|
%I #4 Jan 02 2013 05:36:36
%S 0,0,0,0,13,0,0,141,141,0,0,1570,6153,1570,0,0,16336,275487,275487,
%T 16336,0,0,168102,11620928,50444759,11620928,168102,0,0,1719791,
%U 486820079,8577221762,8577221762,486820079,1719791,0,0,17563383,20299745484
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without 2-loops
%C Table starts
%C .0.......0.........0..........0..........0.............0...........0........0.0
%C .0......13.......141.......1570......16336........168102.....1719791.17563383
%C .0.....141......6153.....275487...11620928.....486820079.20299745484
%C .0....1570....275487...50444759.8577221762.1451267766627
%C .0...16336..11620928.8577221762
%C .0..168102.486820079
%C .0.1719791
%C .0
%H R. H. Hardin, <a href="/A221106/b221106.txt">Table of n, a(n) for n = 1..40</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..0....0..1..4..0....0..0..2..1....0..3..0..0....0..1..3..0
%e ..4..2..0..2....2..0..1..1....1..0..1..4....1..0..4..0....2..3..2..0
%e ..0..3..0..0....0..1..2..0....0..2..1..0....0..0..3..1....0..0..1..0
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Jan 02 2013
|
