Timeline for Formula for a sum of product of binomials
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2018 at 14:07 | comment | added | Will Sawin | @1Spectre1 It's obvious. One counts paths of height $\leq k$, the other of height $=k$, so subtracting cancels the lower-height paths. | |
| Dec 13, 2018 at 13:17 | comment | added | 1Spectre1 | @WillSawin In OEIS A080936, I couldn't see how to compute this: $T(n, k) = A080934(n, k) - A080934(n, k-1).$ | |
| Dec 13, 2018 at 7:27 | vote | accept | 1Spectre1 | ||
| Dec 12, 2018 at 19:18 | comment | added | Will Sawin | @1ENİGMA1 Yes, the same method works. | |
| Dec 12, 2018 at 19:17 | history | edited | Will Sawin | CC BY-SA 4.0 |
added 885 characters in body
|
| Dec 12, 2018 at 17:00 | history | edited | Will Sawin | CC BY-SA 4.0 |
deleted 248 characters in body
|
| Dec 12, 2018 at 16:48 | comment | added | 1ENİGMA1 | Can we obtain formulae for $s_1+s_2+s_3+s_4=n-1$ ? | |
| Dec 12, 2018 at 16:48 | history | edited | Will Sawin | CC BY-SA 4.0 |
added 490 characters in body
|
| Dec 12, 2018 at 16:32 | history | answered | Will Sawin | CC BY-SA 4.0 |