A267197 - OEIS

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

%S 1,1,1,1,3,1,1,10,1,1,1,35,2,0,1,1,126,5,0,0,1,1,462,11,1,0,0,1,1,

%T 1716,26,5,0,0,0,1,1,6435,46,23,1,0,0,0,1,1,24310,121,79,6,0,0,0,0,1,

%U 1,92378,400,178,47,1,0,0,0,0,1,1,352716,1109,336,300,7,0,0,0,0,0,1,1,1352078

%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, southwest 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..2..5..11..26...46..121...400..1109...2924....7992...21954.....61748

%C .1.0..0..1...5..23...79..178...336...835...3128...14040...59621....222502

%C .1.0..0..0...1...6...47..300..1233..3337...7048...15214...43620....224133

%C .1.0..0..0...0...1....7...92..1152..9087..44525..149501..382787....893920

%C .1.0..0..0...0...0....1....8...166..3947..65391..641925.3883236..16199181

%C .1.0..0..0...0...0....0....1.....9...285..13378..457822.9242494.110862397

%C .1.0..0..0...0...0....0....0.....1....10....460...44030.3063056.130348644

%C .1.0..0..0...0...0....0....0.....0.....1.....11.....717..138210..19883831

%H R. H. Hardin, <a href="/A267197/b267197.txt">Table of n, a(n) for n = 1..283</a>

%e Some solutions for n=6 k=7

%e ..0..1..2..3..4..4..5....0..1..2..3..3..4..5....0..1..2..3..4..5..5

%e ..0..1..2..3..4..5..5....0..1..2..3..4..4..5....0..1..2..3..4..5..0

%e ..0..1..2..3..4..5..0....0..1..2..3..4..5..5....1..1..2..3..4..5..0

%e ..1..1..2..3..4..5..0....0..1..2..3..4..5..0....1..2..2..3..4..5..0

%e ..1..2..2..3..4..5..0....1..1..2..3..4..5..0....1..2..3..3..4..5..0

%e ..1..2..3..3..4..5..0....1..2..2..3..4..5..0....1..2..3..4..4..5..0

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

%Y Row 3 is A266879.

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Jan 11 2016