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”).

A267562
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0.
10
1, 1, 1, 1, 3, 2, 1, 10, 2, 6, 1, 35, 6, 2, 24, 1, 126, 31, 3, 2, 120, 1, 462, 141, 15, 3, 2, 720, 1, 1716, 550, 170, 3, 3, 2, 5040, 1, 6435, 2046, 1614, 55, 3, 3, 2, 40320, 1, 24310, 8149, 11048, 1326, 8, 3, 3, 2, 362880, 1, 92378, 34902, 60954, 27712, 279, 8, 3, 3, 2, 3628800
OFFSET
1,5
COMMENTS
Table starts
......1.1..1..1...1....1.....1......1........1..........1............1
......1.3.10.35.126..462..1716...6435....24310......92378.......352716
......2.2..6.31.141..550..2046...8149....34902.....152001.......652150
......6.2..3.15.170.1614.11048..60954...299110....1494098......8772195
.....24.2..3..3..55.1326.27712.392186..4032703...32764364....226023332
....120.2..3..3...8..279.15686.711359.21893719..463755018...7207021169
....720.2..3..3...8...17..2033.279070.27767384.1883165721..86034010064
...5040.2..3..3...8...17....76..21772..7353006.1673476119.250936616799
..40320.2..3..3...8...17....76....424...345843
.362880.2..3..3...8...17....76....424
LINKS
EXAMPLE
Some solutions for n=4 k=4
..0..1..1..2....0..0..1..2....0..1..2..3....0..1..2..3....0..0..0..0
..0..1..2..3....0..1..2..3....0..1..2..3....1..2..3..0....3..3..3..3
..1..2..3..0....1..2..3..3....1..2..3..0....2..3..0..1....2..2..2..2
..2..3..3..0....1..2..3..0....1..2..3..0....2..3..0..1....1..1..1..1
CROSSREFS
Column 1 is A000142(n-1).
Diagonal is A267552.
Row 2 is A001700(n-1).
Row 3 is A267073.
Sequence in context: A129964 A267328 A267425 * A267742 A267278 A267019
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Jan 17 2016
STATUS
approved