%I #7 Aug 12 2016 06:55:34
%S 1,1,1,1,3,1,1,10,1,1,1,35,1,1,1,1,126,1,1,1,1,1,462,1,1,1,1,1,1,1716,
%T 7,1,1,1,1,1,1,6435,41,1,1,1,1,1,1,1,24310,209,1,1,1,1,1,1,1,1,92378,
%U 999,9,1,1,1,1,1,1,1,1,352716,4603,87,1,1,1,1,1,1,1,1,1,1352078,20763,865,1,1
%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, northeast or northwest neighbors modulo n and the upper left element equal to 0.
%C Table starts
%C .1.1..1..1...1...1....1....1.....1.....1......1.......1.......1........1
%C .1.3.10.35.126.462.1716.6435.24310.92378.352716.1352078.5200300.20058300
%C .1.1..1..1...1...7...41..209...999..4603..20763...92601..410279..1811327
%C .1.1..1..1...1...1....1....9....87...865...7649...61021..458527..3292439
%C .1.1..1..1...1...1....1....1.....1....23....303....6023...96925..1428753
%C .1.1..1..1...1...1....1....1.....1.....1......1......41....1769....49639
%C .1.1..1..1...1...1....1....1.....1.....1......1.......1.......1......163
%C .1.1..1..1...1...1....1....1.....1.....1......1.......1.......1........1
%C .1.1..1..1...1...1....1....1.....1.....1......1.......1.......1........1
%C .1.1..1..1...1...1....1....1.....1.....1......1.......1.......1........1
%H R. H. Hardin, <a href="/A267264/b267264.txt">Table of n, a(n) for n = 1..281</a>
%e Some solutions for n=4 k=8
%e ..0..3..3..2..2..1..1..1....0..0..3..3..2..2..1..1....0..0..3..3..2..2..1..1
%e ..0..0..3..3..2..2..1..1....1..0..0..3..3..2..2..2....1..0..0..3..3..2..2..1
%e ..0..0..0..3..3..2..2..1....1..1..0..0..3..3..2..2....1..1..0..0..3..3..2..2
%e ..1..1..0..0..3..3..2..2....1..1..1..0..0..3..3..2....2..1..1..0..0..3..3..2
%Y Row 2 is A001700(n-1).
%Y Row 3 is A266887.
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_, Jan 12 2016