A267278 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest 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, 5, 24, 1, 126, 109, 24, 4, 120, 1, 462, 574, 137, 24, 2, 720, 1, 1716, 2840, 1138, 293, 3, 4, 5040, 1, 6435, 13767, 12214, 2063, 317, 4, 2, 40320, 1, 24310, 71646, 104742, 18276, 6240, 40, 2, 4, 362880, 1, 92378, 390862, 741057
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..1..2..3....0..2..1..0....0..2..1..3....0..3..0..3....0..2..1..3 ..0..1..2..3....2..1..3..2....1..0..3..1....2..0..3..1....2..1..3..2 ..0..1..2..3....0..3..1..0....3..2..1..0....0..2..1..3....0..3..1..0 ..0..1..2..3....3..1..3..2....2..0..3..2....1..1..2..2....2..0..3..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..126
Comments