login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A267751
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.
7
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, 313, 15, 1, 1, 1716, 35003, 54956, 13451, 780, 19, 1, 1, 6435, 362265, 1350674, 679735, 68151, 1789, 24, 1, 1, 24310, 3821877, 34568612, 37668275, 7280046, 314491, 4024
OFFSET
1,5
COMMENTS
Table starts
.1..1....1.......1........1.........1............1............1...........1
.1..3...10......35......126.......462.........1716.........6435.......24310
.1..5...39.....357.....3471.....35003.......362265......3821877....40918431
.1..8..118....2386....54956...1350674.....34568612....910791802.24537293344
.1.11..313...13451...679735..37668275...2218059985.136270559675
.1.15..780...68151..7280046.873319806.113187903900
.1.19.1789..314491.69784981
.1.24.4024.1381976
.1.29.8793
.1.35
LINKS
EXAMPLE
Some solutions for n=4 k=4
..0..0..1..2....0..2..3..0....0..3..1..2....0..0..2..3....0..1..2..0
..1..0..2..2....1..2..3..0....0..3..2..3....1..1..2..3....0..1..3..1
..2..1..3..3....1..3..0..1....1..3..2..0....2..1..3..3....1..2..3..2
..3..1..3..0....2..3..1..2....1..0..2..1....2..1..0..0....2..3..0..3
CROSSREFS
Diagonal is A267624.
Column 2 is A024206(n+1).
Row 2 is A001700(n-1).
Row 3 is A266456.
Sequence in context: A267655 A263864 A060543 * A185996 A261215 A176157
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Jan 20 2016
STATUS
approved