A221408 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two.
0, 2, 2, 0, 6, 0, 4, 16, 16, 4, 0, 44, 0, 44, 0, 8, 120, 436, 436, 120, 8, 0, 328, 0, 4518, 0, 328, 0, 16, 896, 12668, 47156, 47156, 12668, 896, 16, 0, 2448, 0, 492102, 0, 492102, 0, 2448, 0, 32, 6688, 368268, 5133044, 18852560, 18852560, 5133044, 368268, 6688, 32
Offset: 1
Examples
Some solutions for n=3 k=4 ..2..2..0..2....2..0..2..0....2..0..2..2....2..0..2..0....0..2..2..0 ..0..0..0..0....0..2..2..0....0..0..2..0....2..2..2..0....2..0..0..0 ..2..2..2..0....2..0..0..2....0..2..2..0....0..0..2..0....2..2..0..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..84
Comments