A268159 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.
0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 3, 8, 6, 0, 0, 7, 14, 36, 0, 0, 0, 17, 52, 906, 456, 120, 0, 0, 42, 1516, 31818, 23592, 6360, 0, 0, 0, 104, 7582, 770406, 10213152, 3304920, 93600, 5040, 0, 0, 259, 46338, 28194516, 871718016, 4067565720, 334738800, 1784160, 0, 0, 0, 648
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..3..3..1....0..3..2..3....0..3..1..2....0..2..1..2....0..0..1..1 ..0..3..2..1....0..3..2..3....0..3..1..2....0..2..1..2....0..1..2..1 ..3..2..0..1....1..1..0..2....3..0..2..1....1..3..0..3....0..2..3..3 ..2..2..0..1....1..1..0..2....3..0..2..1....1..3..0..3....2..2..3..3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..61
Comments