login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A267990
T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums and column sums nondecreasing.
5
1, 1, 1, 1, 4, 1, 1, 5, 21, 1, 1, 15, 145, 189, 1, 1, 21, 1122, 7477, 1941, 1, 1, 57, 7886, 425488, 760736, 28032, 1, 1, 85, 58446, 20924732, 399858087, 122958209, 448157, 1, 1, 220, 405196, 1102544770
OFFSET
1,5
COMMENTS
Table starts
.1......1.........1.........1........1..........1......1...1.1
.1......4.........5........15.......21.........57.....85.220
.1.....21.......145......1122.....7886......58446.405196
.1....189......7477....425488.20924732.1102544770
.1...1941....760736.399858087
.1..28032.122958209
.1.448157
.1
EXAMPLE
Some solutions for n=3, k=4
..0..0..2..1....1..0..2..0....0..0..0..2....0..0..1..1....0..1..0..2
..1..0..2..1....0..1..1..2....1..1..2..0....0..1..0..2....2..1..1..0
..1..2..0..2....1..2..0..2....1..2..1..2....2..1..2..2....0..1..2..2
CROSSREFS
Sequence in context: A114033 A334426 A209417 * A084061 A140262 A049702
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Jan 23 2016
STATUS
approved