OFFSET
1,2
COMMENTS
T(n,k) is the number of pairs (f,i) such that f is a parking function and f(i) = k.
FORMULA
EXAMPLE
Triangle begins:
====================================================================
n\k| 1 2 3 4 5 6 7 8
---|----------------------------------------------------------------
1 | 1
2 | 4 2
3 | 24 15 9
4 | 200 136 100 64
5 | 2160 1535 1215 945 625
6 | 28812 21036 17286 14406 11526 7776
7 | 458752 341103 286671 247296 211456 172081 117649
8 | 8503056 6405904 5464712 4811528 4251528 3691528 3038344 2097152
...
MATHEMATICA
Table[n Sum[Binomial[n - 1, j - 1] j^(j - 2)*(n + 1 - j)^(n - 1 - j), {j, k, n}], {n, 9}, {k, n}] // Flatten (* Michael De Vlieger, Jan 22 2018 *)
CROSSREFS
KEYWORD
AUTHOR
Rui Duarte, Jan 22 2018
STATUS
approved