Timeline for Closed form expression for a recursion relation with binomial coefficients
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2019 at 14:28 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
more informative title
|
| Feb 18, 2019 at 12:53 | comment | added | Martin Rubey |
Here is a recipe: sage: T = lambda n: x if n == 0 else sum(binomial(n,k)*T(k) for k in range(n)) sage: T = cached_function(T) sage: [T(n) for n in range(5)] [x, x, 3*x, 13*x, 75*x] sage: oeis([T(n)/x for n in range(20)]) 0: A000670: Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n].
|
|
| Feb 18, 2019 at 12:48 | answer | added | Carlo Beenakker | timeline score: 10 | |
| Feb 18, 2019 at 12:40 | review | First posts | |||
| Feb 18, 2019 at 13:59 | |||||
| Feb 18, 2019 at 12:37 | history | asked | Sharky | CC BY-SA 4.0 |