A267019 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo n and the upper left element equal to 0.
1, 1, 1, 1, 3, 2, 1, 10, 5, 6, 1, 35, 15, 8, 24, 1, 126, 59, 21, 11, 120, 1, 462, 257, 137, 45, 15, 720, 1, 1716, 1205, 759, 259, 37, 19, 5040, 1, 6435, 5879, 4835, 2063, 537, 147, 24, 40320, 1, 24310, 29693, 31591, 18157, 5493, 1015, 62, 29, 362880, 1, 92378, 153097
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..2..3..2....0..1..3..2....0..1..3..2....0..3..1..2....0..3..0..2 ..2..0..2..0....2..0..2..0....2..0..2..0....3..1..3..1....3..1..3..1 ..1..3..1..3....1..3..1..3....0..3..1..2....2..0..2..0....2..0..1..3 ..0..1..3..1....3..2..0..1....3..1..3..1....0..2..1..3....1..2..0..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..126
Comments