A267629 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.
1, 1, 1, 1, 3, 2, 1, 10, 7, 6, 1, 35, 39, 27, 24, 1, 126, 265, 208, 138, 120, 1, 462, 1802, 2386, 1576, 900, 720, 1, 1716, 12239, 32208, 29387, 14830, 7110, 5040, 1, 6435, 84614, 445970, 679735, 469605, 168500, 66150, 40320, 1, 24310, 597601, 6039160, 17761798
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..0..1..1....0..1..2..2....0..1..2..3....0..1..2..2....0..1..2..3 ..1..2..2..3....1..2..3..0....3..0..1..1....2..3..3..3....2..2..2..3 ..2..3..3..0....3..3..0..1....2..2..3..0....0..1..2..3....0..1..1..1 ..2..3..0..1....3..0..1..2....1..2..3..0....0..0..1..1....3..3..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..83
Comments