A221255 T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2.
0, 1, 0, 2, 4, 0, 4, 8, 16, 0, 8, 81, 30, 64, 0, 16, 392, 2116, 112, 256, 0, 32, 2500, 22268, 58081, 418, 1024, 0, 64, 14112, 488601, 1319409, 1612900, 1560, 4096, 0, 128, 83521, 7356420, 103489929, 78633756, 44903401, 5822, 16384, 0, 256, 484128, 132273001
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..2..1..0....0..2..2..0....0..2..2..1....0..2..2..1....1..1..0..1 ..0..2..1..2....0..2..1..0....0..1..1..1....1..0..1..1....1..1..1..1 ..2..0..1..0....2..1..1..1....2..1..1..0....1..1..1..1....1..1..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..126
Comments