The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Aug 12 2016 06:55:35
%S 1,1,1,1,3,1,1,10,5,1,1,35,39,8,1,1,126,357,118,11,1,1,462,3471,2386,
%T 313,15,1,1,1716,35003,54956,13451,780,19,1,1,6435,362265,1350674,
%U 679735,68151,1789,24,1,1,24310,3821877,34568612,37668275,7280046,314491,4024
%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.
%C Table starts
%C .1..1....1.......1........1.........1............1............1...........1
%C .1..3...10......35......126.......462.........1716.........6435.......24310
%C .1..5...39.....357.....3471.....35003.......362265......3821877....40918431
%C .1..8..118....2386....54956...1350674.....34568612....910791802.24537293344
%C .1.11..313...13451...679735..37668275...2218059985.136270559675
%C .1.15..780...68151..7280046.873319806.113187903900
%C .1.19.1789..314491.69784981
%C .1.24.4024.1381976
%C .1.29.8793
%C .1.35
%H R. H. Hardin, <a href="/A267751/b267751.txt">Table of n, a(n) for n = 1..72</a>
%e Some solutions for n=4 k=4
%e ..0..0..1..2....0..2..3..0....0..3..1..2....0..0..2..3....0..1..2..0
%e ..1..0..2..2....1..2..3..0....0..3..2..3....1..1..2..3....0..1..3..1
%e ..2..1..3..3....1..3..0..1....1..3..2..0....2..1..3..3....1..2..3..2
%e ..3..1..3..0....2..3..1..2....1..0..2..1....2..1..0..0....2..3..0..3
%Y Diagonal is A267624.
%Y Column 2 is A024206(n+1).
%Y Row 2 is A001700(n-1).
%Y Row 3 is A266456.
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_, Jan 20 2016