A268142 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one diagonal or antidiagonal neighbor and the top left element equal to 0.
0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 3, 0, 6, 0, 0, 5, 8, 6, 0, 0, 0, 12, 32, 672, 0, 120, 0, 0, 26, 238, 4734, 5760, 120, 0, 0, 0, 60, 1488, 177048, 218880, 1411560, 0, 5040, 0, 0, 143, 9778, 4131792, 59028840, 97608120, 25024320, 5040, 0, 0, 0, 353, 91628, 132137160
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..3..3..2....0..3..2..3....0..2..3..3....0..3..2..0....0..2..2..3 ..3..0..2..3....3..0..3..2....2..0..3..3....3..0..0..2....2..0..3..2 ..1..2..0..1....2..0..1..1....1..0..1..2....1..1..3..2....0..3..1..1 ..2..1..1..0....0..2..1..1....0..1..2..1....1..1..2..3....3..0..1..1
Comments