%I #4 Jan 11 2013 21:04:15
%S 0,0,0,0,1,0,0,18,7,0,0,148,370,38,0,0,1164,12296,6893,190,0,0,8824,
%T 364868,938070,122690,918,0,0,65932,10612940,103485930,68449305,
%U 2152076,4367,0,0,489456,304064432,11446121074,27908486602,4937698670,37541550
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, without 2-loops
%C Table starts
%C .0.....0........0..........0...........0...........0.............0..........0
%C .0.....1.......18........148........1164........8824.........65932.....489456
%C .0.....7......370......12296......364868....10612940.....304064432.8672312531
%C .0....38.....6893.....938070...103485930.11446121074.1234879060395
%C .0...190...122690...68449305.27908486602
%C .0...918..2152076.4937698670
%C .0..4367.37541550
%C .0.20623
%C .0
%H R. H. Hardin, <a href="/A221351/b221351.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..0..2..0..1....1..3..1..0....0..0..3..0....0..0..2..1....1..1..1..0
%e ..1..3..4..0....0..1..4..1....0..3..1..1....0..1..2..0....0..0..2..2
%e ..0..0..1..0....0..0..0..1....1..1..1..1....1..3..1..1....0..3..2..0
%Y Column 2 is A217340
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Jan 11 2013