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

A267021
Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo n and the upper left element equal to 0.
0
1, 10, 59, 759, 18157, 912057, 100710495
OFFSET
1,2
COMMENTS
Superdiagonal 1 of A267019.
EXAMPLE
Some solutions for n=4
..0..1..3..1..0....0..1..3..1..3....0..2..1..3..0....0..2..0..2..0
..2..0..2..0..2....2..0..1..3..1....3..1..3..1..3....2..0..3..1..2
..1..3..1..3..1....0..2..0..2..3....2..3..2..0..1....1..3..1..3..1
..3..2..3..2..0....2..1..2..0..3....0..2..0..2..1....3..2..0..1..3
CROSSREFS
Cf. A267019.
Sequence in context: A326827 A054489 A219580 * A213346 A140890 A055714
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 09 2016
STATUS
approved