%I #4 Jan 01 2013 08:42:43
%S 0,1,0,2,4,0,4,24,16,0,8,169,270,64,0,16,1155,6889,3024,256,0,32,7921,
%T 154440,279841,33858,1024,0,64,54288,3538161,20489472,11363641,379080,
%U 4096,0,128,372100,80655102,1572836281,2714713664,461433361,4244238
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor
%C Table starts
%C .0.......1............2...................4.......................8
%C .0.......4...........24.................169....................1155
%C .0......16..........270................6889..................154440
%C .0......64.........3024..............279841................20489472
%C .0.....256........33858............11363641..............2714713664
%C .0....1024.......379080...........461433361............359601021696
%C .0....4096......4244238.........18736955689..........47632473997312
%C .0...16384.....47519136........760832274049........6309330479063040
%C .0...65536....532031490......30894332043289......835724490894491648
%C .0..262144...5956705656....1254494297783281...110698808144126017536
%C .0.1048576..66692184462...50939956897994761.14662997339235235397632
%C .0.4194304.746695862640.2068466324059544161
%H R. H. Hardin, <a href="/A221087/b221087.txt">Table of n, a(n) for n = 1..126</a>
%e Some solutions for n=3 k=4
%e ..0..1..2..0....1..1..1..0....0..1..1..0....1..1..0..1....0..2..1..1
%e ..1..3..1..1....0..4..0..0....0..3..3..0....1..3..1..0....2..1..1..1
%e ..0..1..2..0....2..1..2..0....0..2..2..0....1..0..2..1....1..0..1..1
%Y Column 2 is A000302(n-1)
%Y Row 1 is A000079(n-2)
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_ Jan 01 2013