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

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

%S 1,1,1,1,1,2,1,2,11,6,1,3,91,234,24,1,6,829,14540,8466,120,1,10,8013,

%T 1044230,5127134,465690,720,1,20,80497,81918724,3801147519,3413004556,

%U 36290610,5040,1,35,830673,6799306012,3172383570943,32355628895416

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

%C Table starts

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

%C ......1............1................2..................3..................6

%C ......2...........11...............91................829...............8013

%C ......6..........234............14540............1044230...........81918724

%C .....24.........8466..........5127134.........3801147519......3172383570943

%C ....120.......465690.......3413004556.....32355628895416.355414429986675560

%C ....720.....36290610....3833960867620.552401151665874798

%C ...5040...3806425980.6716778465903760

%C ..40320.517149634680

%C .362880

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

%e Some solutions for n=3 k=4

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

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

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

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

%Y Row 2 is A001405(n-1).

%K nonn,tabl

%O 1,6

%A _R. H. Hardin_, Jan 02 2016