login
A267197
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.
9
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, 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, 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
OFFSET
1,5
COMMENTS
Table starts
.1.1..1..1...1...1....1....1.....1.....1......1.......1.......1.........1
.1.3.10.35.126.462.1716.6435.24310.92378.352716.1352078.5200300..20058300
.1.1..2..5..11..26...46..121...400..1109...2924....7992...21954.....61748
.1.0..0..1...5..23...79..178...336...835...3128...14040...59621....222502
.1.0..0..0...1...6...47..300..1233..3337...7048...15214...43620....224133
.1.0..0..0...0...1....7...92..1152..9087..44525..149501..382787....893920
.1.0..0..0...0...0....1....8...166..3947..65391..641925.3883236..16199181
.1.0..0..0...0...0....0....1.....9...285..13378..457822.9242494.110862397
.1.0..0..0...0...0....0....0.....1....10....460...44030.3063056.130348644
.1.0..0..0...0...0....0....0.....0.....1.....11.....717..138210..19883831
LINKS
EXAMPLE
Some solutions for n=6 k=7
..0..1..2..3..4..4..5....0..1..2..3..3..4..5....0..1..2..3..4..5..5
..0..1..2..3..4..5..5....0..1..2..3..4..4..5....0..1..2..3..4..5..0
..0..1..2..3..4..5..0....0..1..2..3..4..5..5....1..1..2..3..4..5..0
..1..1..2..3..4..5..0....0..1..2..3..4..5..0....1..2..2..3..4..5..0
..1..2..2..3..4..5..0....1..1..2..3..4..5..0....1..2..3..3..4..5..0
..1..2..3..3..4..5..0....1..2..2..3..4..5..0....1..2..3..4..4..5..0
CROSSREFS
Row 2 is A001700(n-1).
Row 3 is A266879.
Sequence in context: A045912 A290554 A267264 * A267401 A267338 A158695
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Jan 11 2016
STATUS
approved