editing

approved

R. H. Hardin, <a href="/A221314/b221314.txt">Table of n, a(n) for n = 1..97</a>

allocated for R. H. Hardin

T(n,k)=Square root of number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two

0, 0, 0, 0, 2, 0, 1, 0, 0, 1, 0, 4, 0, 4, 0, 0, 0, 9, 9, 0, 0, 0, 8, 0, 23, 0, 8, 0, 1, 0, 0, 57, 57, 0, 0, 1, 0, 16, 0, 142, 0, 142, 0, 16, 0, 0, 0, 105, 353, 0, 0, 353, 105, 0, 0, 0, 32, 0, 878, 0, 2816, 0, 878, 0, 32, 0, 1, 0, 0, 2183, 6898, 0, 0, 6898, 2183, 0, 0, 1, 0, 64, 0, 5428, 0

1,5

Table starts

.0..0...0....1....0.....0...0.....1....0....0.....0....1.0.0

.0..2...0....4....0.....8...0....16....0...32.....0...64.0

.0..0...0....9....0.....0...0...105....0....0.....0.1233

.1..4...9...23...57...142.353...878.2183.5428.13496

.0..0...0...57....0.....0...0..6898....0....0

.0..8...0..142....0..2816...0.55033....0

.0..0...0..353....0.....0...0

.1.16.105..878.6898.55033

.0..0...0.2183....0

.0.32...0.5428

.0..0...0

.1.64

Some solutions for n=3 k=4

..2..0..2..0....2..0..0..0....0..0..2..2....2..0..0..2....2..0..2..2

..2..0..2..0....2..0..2..2....2..2..2..0....2..2..2..2....2..0..0..0

..0..2..2..0....0..2..2..0....0..0..2..0....0..0..0..0....0..2..2..0

allocated

nonn,tabl

R. H. Hardin Jan 10 2013

approved

editing

allocated for R. H. Hardin

allocated

approved