%I #4 Jan 28 2013 04:14:06
%S 0,1,1,0,20,0,1,162,162,1,0,1442,2847,1442,0,1,12688,109441,109441,
%T 12688,1,0,110720,2902629,14388224,2902629,110720,0,1,970828,89325897,
%U 1572414124,1572414124,89325897,970828,1,0,8489090,2568285560
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction
%C Table starts
%C .0.......1..........0............1............0............1..............0
%C .1......20........162.........1442........12688.......110720.........970828
%C .0.....162.......2847.......109441......2902629.....89325897.....2568285560
%C .1....1442.....109441.....14388224...1572414124.180850094177.20435867743591
%C .0...12688....2902629...1572414124.598006815909
%C .1..110720...89325897.180850094177
%C .0..970828.2568285560
%C .1.8489090
%C .0
%H R. H. Hardin, <a href="/A221873/b221873.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..0..0..0..2....2..0..0..2....0..1..1..1....0..1..1..0....1..1..1..0
%e ..3..2..2..1....2..2..1..0....3..1..0..3....2..1..0..0....1..3..0..2
%e ..1..0..1..0....1..0..1..1....0..1..1..0....1..2..3..1....1..1..0..1
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Jan 28 2013
