A221139 T(n,k) = number of n X k arrays of occupancy after each element moves to some horizontal or vertical neighbor, with no occupancy greater than 2.
0, 1, 1, 2, 9, 2, 4, 49, 49, 4, 8, 289, 656, 289, 8, 16, 1681, 12544, 12544, 1681, 16, 32, 9801, 200072, 643204, 200072, 9801, 32, 64, 57121, 3485689, 31203396, 31203396, 3485689, 57121, 64, 128, 332929, 58132316, 1539699121, 4235650596, 1539699121
Offset: 1
Examples
Some solutions for n=3, k=4: ..1..1..1..2....1..1..1..1....1..1..0..2....1..1..2..1....1..1..2..0 ..2..1..0..1....0..0..1..0....2..2..1..1....1..2..0..1....1..1..0..0 ..0..1..2..0....2..2..2..1....0..0..2..0....0..2..0..1....1..2..1..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..84
Comments