login
T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction
4

%I #4 Jan 30 2013 05:24:22

%S 1,3,3,6,33,6,13,326,326,13,28,3223,11878,3223,28,60,31832,449069,

%T 449069,31832,60,129,314426,16834526,65039658,16834526,314426,129,277,

%U 3105733,632170065,9356131846,9356131846,632170065,3105733,277,595,30676867

%N T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction

%C Table starts

%C ...1........3...........6............13............28............60

%C ...3.......33.........326..........3223.........31832........314426

%C ...6......326.......11878........449069......16834526.....632170065

%C ..13.....3223......449069......65039658....9356131846.1347142288446

%C ..28....31832....16834526....9356131846.5123355027782

%C ..60...314426...632170065.1347142288446

%C .129..3105733.23731120064

%C .277.30676867

%C .595

%H R. H. Hardin, <a href="/A221886/b221886.txt">Table of n, a(n) for n = 1..49</a>

%e Some solutions for n=3 k=4

%e ..0..3..0..2....0..3..1..0....0..4..0..0....0..1..1..1....0..2..0..1

%e ..0..4..1..0....0..0..2..0....0..0..0..1....0..1..1..3....1..2..0..2

%e ..1..0..1..0....1..1..2..2....2..1..2..2....3..1..0..0....0..2..1..1

%Y Column 1 is A002478

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Jan 30 2013