A221273 T(n,k) is the number of n X k arrays of occupancy after each element moves to some king-move neighbor, with every occupancy equal to zero or two.

0, 0, 0, 0, 6, 0, 1, 16, 16, 1, 0, 52, 0, 52, 0, 0, 174, 596, 596, 174, 0, 0, 588, 0, 7252, 0, 588, 0, 1, 1984, 24366, 94659, 94659, 24366, 1984, 1, 0, 6688, 0, 1250015, 0, 1250015, 0, 6688, 0, 0, 22536, 1001855, 16474842, 64221682, 64221682, 16474842, 1001855

Offset: 1

Author

R. H. Hardin, Jan 08 2013

Keywords

• nonn
• tabl
• changed

Examples

			Table starts:
.0.....0.......0........1........0........0........0.........1.....0.....0.0
.0.....6......16.......52......174......588.....1984......6688.22536.75924
.0....16.......0......596........0....24366........0...1001855.....0
.1....52.....596.....7252....94659..1250015.16474842.217194702
.0...174.......0....94659........0.64221682
.0...588...24366..1250015.64221682
.0..1984.......0.16474842
.1..6688.1001855
.0.22536
.0
Some solutions for n=4 and k=4:
..2..0..0..0....0..0..2..2....2..0..0..0....2..0..2..0....2..2..0..2
..0..2..2..0....0..2..2..2....2..0..0..2....0..2..2..0....2..0..2..0
..2..0..0..2....0..2..2..0....2..0..0..2....0..2..0..0....0..2..2..0
..2..2..0..2....2..0..0..0....2..2..2..0....2..0..2..2....0..2..0..0
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..59