OFFSET
0,6
COMMENTS
T(n,k) is defined for n,k >= 0. The triangle contains only the terms with k<=n. T(n,k) = n! for k>=n.
LINKS
Alois P. Heinz, Rows n = 0..20, flattened
Roberto Tauraso, The Dinner Table Problem: The Rectangular Case, INTEGERS: Electronic Journal of Combinatorial Number Theory, Vol. 6 (2006), #A11.
Wikipedia, Permutation
EXAMPLE
Triangle T(n,k) begins:
1;
0, 1;
0, 0, 2;
0, 0, 4, 6;
0, 2, 16, 20, 24;
0, 14, 44, 80, 108, 120;
0, 90, 200, 384, 544, 672, 720;
0, 646, 1288, 2240, 3264, 4128, 4800, 5040;
0, 5242, 9512, 15424, 23040, 28992, 34752, 38880, 40320;
...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Alois P. Heinz, Apr 02 2020
STATUS
approved