login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west or northeast neighbor modulo n and the upper left element equal to 0.
6

%I #6 Aug 12 2016 06:55:34

%S 1,1,0,1,0,1,1,0,2,2,1,0,5,9,9,1,0,12,91,435,44,1,0,33,1233,40727,

%T 20375,265,1,0,97,18827,4947399,20874574,1624164,1854,1,0,278,323444,

%U 697988671,30003358804,23274835718,170338575,14833,1,0,821,5826961,108770442228

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west or northeast neighbor modulo n and the upper left element equal to 0.

%C Table starts

%C ......1...........1..............1...............1..............1............1

%C ......0...........0..............0...............0..............0............0

%C ......1...........2..............5..............12.............33...........97

%C ......2...........9.............91............1233..........18827.......323444

%C ......9.........435..........40727.........4947399......697988671.108770442228

%C .....44.......20375.......20874574.....30003358804.51630917278193

%C ....265.....1624164....23274835718.485721755903466

%C ...1854...170338575.39868129982498

%C ..14833.23301045360

%C .133496

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

%e Some solutions for n=4 k=4

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

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

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

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

%Y Column 1 is A000166(n-1).

%K nonn,tabl

%O 1,9

%A _R. H. Hardin_, Dec 26 2015