A267751 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.
1, 1, 1, 1, 3, 1, 1, 10, 5, 1, 1, 35, 39, 8, 1, 1, 126, 357, 118, 11, 1, 1, 462, 3471, 2386, 313, 15, 1, 1, 1716, 35003, 54956, 13451, 780, 19, 1, 1, 6435, 362265, 1350674, 679735, 68151, 1789, 24, 1, 1, 24310, 3821877, 34568612, 37668275, 7280046, 314491, 4024
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..0..1..2....0..2..3..0....0..3..1..2....0..0..2..3....0..1..2..0 ..1..0..2..2....1..2..3..0....0..3..2..3....1..1..2..3....0..1..3..1 ..2..1..3..3....1..3..0..1....1..3..2..0....2..1..3..3....1..2..3..2 ..3..1..3..0....2..3..1..2....1..0..2..1....2..1..0..0....2..3..0..3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..72
Comments