OFFSET
1,2
COMMENTS
T(n,m) = number of n X m arrays with each row a permutation of 1..m and rows lexicographically in strictly increasing order.
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..1275
FORMULA
T(n,m) = binomial(m!,n).
EXAMPLE
Table starts
1 2 6 24 120 720 5040 40320 362880 3628800
0 1 15 276 7140 258840 12698280 812831040 65840765760
0 0 20 2024 280840 61949040 21324644880 10923907290240
0 0 15 10626 8214570 11104365420 26853059065140
0 0 6 42504 190578024 1590145128144
0 0 1 134596 3652745460
0 0 0 346104
0 0 0
0 0
0
MATHEMATICA
t[n_, m_] := Binomial[m!, n]; Table[t[m - n + 1, n], {m, 9}, {n, m, 1, -1}] // Flatten (* to display table in Comment *) Table[ t[m, n], {m, 10}, {n, 8}] // TableForm (* Robert G. Wilson v, Sep 02 2010 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Sep 01 2010
STATUS
approved