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 move-in move-out straight through or left turns
8

%I #4 Jan 30 2013 19:31:04

%S 1,3,3,6,31,6,13,258,266,13,28,2241,7667,2305,28,60,19408,236532,

%T 235332,19936,60,129,167960,7235107,25821731,7197649,172624,129,277,

%U 1453952,221465158,2815434576,2814706089,220361275,1494152,277,595,12585637

%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 move-in move-out straight through or left turns

%C Table starts

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

%C ...3.......31........258.........2241.........19408.......167960........1453952

%C ...6......266.......7667.......236532.......7235107....221465158.....6778558415

%C ..13.....2305.....235332.....25821731....2815434576.307126807101.33499434763000

%C ..28....19936....7197649...2814706089.1093046005330

%C ..60...172624..220361275.307131177266

%C .129..1494152.6744533268

%C .277.12933821

%C .595

%C Row and column 2, and row and column 3, have different values but the same recurrences

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

%e Some solutions for n=3 k=4

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

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

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

%Y Column 1 and row 1 are A002478

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Jan 30 2013