A221337 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, with every occupancy equal to zero or two.
0, 2, 2, 0, 6, 0, 4, 20, 20, 4, 0, 68, 0, 68, 0, 8, 232, 790, 790, 232, 8, 0, 792, 0, 10704, 0, 792, 0, 16, 2704, 34042, 142792, 142792, 34042, 2704, 16, 0, 9232, 0, 1937900, 0, 1937900, 0, 9232, 0, 32, 31520, 1470618, 26264018
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..2..2..2....2..0..0..0....2..0..2..0....0..0..2..0....0..2..2..0 ..2..0..0..0....2..2..2..0....0..0..2..0....2..2..0..0....2..2..0..0 ..0..2..0..2....0..2..0..2....2..0..2..2....2..0..2..2....0..0..2..2
Comments