login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its 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,1,1,0,2,1,0,4,6,1,0,17,72,24,1,0,57,1304,2760,120,1,0,207,31501,

%T 530368,154240,720,1,0,786,843874,132028418,358960340,12199500,5040,1,

%U 0,3057,24244702,37478933496,1141696526832,415907473523,1293877704,40320,1

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its 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 ...1........0............0.................0................0..............0

%C ...2........4...........17................57..............207............786

%C ...6.......72.........1304.............31501...........843874.......24244702

%C ..24.....2760.......530368.........132028418......37478933496.11567328302147

%C .120...154240....358960340.....1141696526832.4269042158821685

%C .720.12199500.415907473523.20266647672702159

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

%e Some solutions for n=4 k=4

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

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

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

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

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

%K nonn,tabl

%O 1,6

%A _R. H. Hardin_, Jan 04 2016