%I #4 Jan 02 2013 12:04:41
%S 0,0,0,0,0,0,0,1,0,0,0,7,8,0,0,0,38,178,51,0,0,0,190,2952,3706,304,0,
%T 0,0,918,45842,189762,73267,1769,0,0,0,4367,693362,9107191,11678172,
%U 1424745,10200,0,0,0,20623,10369358,423897591,1734890879,709142453,27551817
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without 2-loops
%C Table starts
%C .0.0........0............0...............0.................0.................0
%C .0.0........1............7..............38...............190...............918
%C .0.0........8..........178............2952.............45842............693362
%C .0.0.......51.........3706..........189762...........9107191.........423897591
%C .0.0......304........73267........11678172........1734890879......247812858484
%C .0.0.....1769......1424745.......709142453......326416281638...143089274586815
%C .0.0....10200.....27551817.....42873095694....61164981824003.82293038769560932
%C .0.0....58603....531785885...2588202786224.11445464707934974
%C .0.0...336224..10257442136.156169886336266
%C .0.0..1927953.197807790635
%C .0.0.11052712
%C .0.0
%H R. H. Hardin, <a href="/A221114/b221114.txt">Table of n, a(n) for n = 1..96</a>
%e Some solutions for n=3 k=4
%e ..0..1..0..0....0..1..0..0....0..2..1..1....0..2..2..1....0..2..1..0
%e ..1..3..3..1....1..3..3..1....0..1..3..0....0..1..2..1....0..1..3..1
%e ..0..1..2..0....1..1..1..0....1..2..1..0....0..1..2..0....0..2..2..0
%Y Column 3 is A153594(n-1)
%Y Row 2 is A217340(n-1)
%K nonn,tabl
%O 1,12
%A _R. H. Hardin_ Jan 02 2013