login
T(n,k)=Number of nXk 0..6 arrays with no element equal to another within a city block distance of two, and new values 0..6 introduced in row major order
6

%I #5 Mar 31 2012 12:37:11

%S 1,1,1,1,1,1,2,4,4,2,5,33,55,33,5,15,380,1368,1368,380,15,52,4801,

%T 34442,67716,34442,4801,52,202,62004,868994,3328979,3328979,868994,

%U 62004,202,855,804833,21916090,164270604,319902496,164270604,21916090,804833,855

%N T(n,k)=Number of nXk 0..6 arrays with no element equal to another within a city block distance of two, and new values 0..6 introduced in row major order

%C Table starts

%C ...1......1.........1..........2...........5..........15............52

%C ...1......1.........4.........33.........380........4801.........62004

%C ...1......4........55.......1368.......34442......868994......21916090

%C ...2.....33......1368......67716.....3328979...164270604....8094257014

%C ...5....380.....34442....3328979...319902496.30809397399.2965468376203

%C ..15...4801....868994..164270604.30809397399

%C ..52..62004..21916090.8094257014

%C .202.804833.552801398

%H R. H. Hardin, <a href="/A206389/b206389.txt">Table of n, a(n) for n = 1..60</a>

%e Some solutions for n=4 k=3

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

%e ..2..3..0....2..3..0....3..4..0....2..3..4....2..3..4....3..4..5....2..3..4

%e ..4..5..1....4..5..6....1..2..5....4..5..1....1..5..6....5..2..1....4..5..6

%e ..6..2..4....6..2..1....6..0..1....6..0..2....6..2..0....1..6..4....6..0..1

%Y Column 1 is A056272(n-2)

%Y Column 2 is A198900(n-1)

%K nonn,tabl

%O 1,7

%A _R. H. Hardin_ Feb 07 2012