|
%I #4 Jan 09 2013 16:36:16
%S 0,10,0,312,0,10042,0,319226,0,10133708,0,321533586,0,10200714244,0,
%T 323608871782,0,10266122386790,0,325680263163306,0,10331804351728716,
%U 0,327763686122256921,0,10397896202291347434,0,329860349856599608391,0
%N Number of nX3 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with every occupancy equal to zero or two
%C Column 3 of A221308
%H R. H. Hardin, <a href="/A221305/b221305.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 33*a(n-2) -2*a(n-4) -1074*a(n-6) -4389*a(n-8) -8373*a(n-10) -9016*a(n-12) -5198*a(n-14) -28*a(n-16) +3296*a(n-18) +3856*a(n-20) +2610*a(n-22) +1148*a(n-24) +302*a(n-26) +8*a(n-28) -28*a(n-30) -8*a(n-32) for n>34
%e Some solutions for n=4
%e ..0..2..2....0..0..2....0..2..2....2..2..0....0..2..0....0..2..0....0..2..2
%e ..0..0..0....2..2..0....0..2..0....0..2..0....0..2..0....2..2..0....0..2..2
%e ..2..2..0....2..0..2....0..2..2....2..2..2....0..2..0....0..2..0....0..2..0
%e ..0..2..2....0..2..0....2..0..0....0..0..0....2..2..2....2..2..0....0..2..0
%K nonn
%O 1,2
%A _R. H. Hardin_ Jan 09 2013
|
