Timeline for Formula for a sum of product of binomials
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 12, 2018 at 21:34 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
deleted 638 characters in body
|
Dec 12, 2018 at 18:25 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 25 characters in body
|
Dec 12, 2018 at 14:50 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 132 characters in body
|
Dec 12, 2018 at 14:49 | comment | added | efs | A "not very nice" idea is that your formula should satisfy a recurrence relation. Encode it in a power series, use decomposition into partial fractions and obtain another power series such that its coefficients are the $a_n$; just like for the explicit formula for Fibonacci numbers. | |
Dec 12, 2018 at 14:46 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 132 characters in body
|
Dec 12, 2018 at 14:24 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 269 characters in body
|
Dec 12, 2018 at 14:19 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 269 characters in body
|
Dec 12, 2018 at 13:48 | comment | added | 1Spectre1 | Is it possible to prove result? | |
Dec 12, 2018 at 13:40 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 307 characters in body
|
Dec 12, 2018 at 13:34 | comment | added | Liviu Nicolaescu | Why is $a_n=$OEIS A258109? | |
Dec 12, 2018 at 13:24 | history | answered | Carlo Beenakker | CC BY-SA 4.0 |