login
A180839
T(n,k) = number of n X k arrays containing k indistinguishable copies of 1..n with rows and columns in lexicographically strictly increasing order.
4
1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 77, 72, 1, 1, 0, 472, 5385, 678, 1, 1, 0, 2164, 300888, 545426, 7719, 1, 1, 0, 7919, 13455048, 333191079, 79230924, 102963, 1, 1, 0, 23808, 506119693, 167550354642, 637698093267, 15755497776, 1573764, 1, 1, 0, 59823
OFFSET
1,9
COMMENTS
Table starts
.1.......1...........1............1............1..............1...........1.....1.1.1
.1.......1...........1............1............0..............0...........0.....0.0
.1.......9..........77..........472.........2164...........7919.......23808.59823
.1......72........5385.......300888.....13455048......506119693.16461677047
.1.....678......545426....333191079.167550354642.72310597296863
.1....7719....79230924.637698093267
.1..102963.15755497776
.1.1573764
.1
LINKS
CROSSREFS
Sequence in context: A361064 A322029 A322107 * A272232 A239797 A010163
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Sep 20 2010
STATUS
approved