login
T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order
5

%I #4 Feb 27 2013 16:53:24

%S 1,1,1,2,7,2,11,60,60,11,34,724,1229,724,34,131,7364,61757,61757,7364,

%T 131,438,84816,1073368,5024944,1073368,84816,438,2150,927152,58834301,

%U 411489189,411489189,58834301,927152,2150,7676,10585088,1009942505

%N T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order

%C Table starts

%C .....1.........1...........2............11.............34............131

%C .....1.........7..........60...........724...........7364..........84816

%C .....2........60........1229.........61757........1073368.......58834301

%C ....11.......724.......61757.......5024944......411489189....33625853402

%C ....34......7364.....1073368.....411489189....46185208463.19094951329287

%C ...131.....84816....58834301...33625853402.19094951329287

%C ...438....927152..1009942505.2757290901238

%C ..2150..10585088.57422493141

%C ..7676.119198624

%C .32491

%H R. H. Hardin, <a href="/A222654/b222654.txt">Table of n, a(n) for n = 1..59</a>

%e Some solutions for n=3 k=4

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

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

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

%K nonn,tabl

%O 1,4

%A _R. H. Hardin_ Feb 27 2013