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

A267280
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 southwest or northwest neighbors modulo n and the upper left element equal to 0.
0
1, 10, 109, 1138, 18276, 663855, 55479601, 12194740046
OFFSET
1,2
COMMENTS
Superdiagonal 1 of A267278.
EXAMPLE
Some solutions for n=4
..0..3..2..1..0....0..2..1..3..2....0..3..2..0..0....0..3..2..1..3
..2..1..0..3..1....2..1..3..1..0....2..1..0..3..1....3..1..0..2..1
..1..3..2..0..0....0..3..1..3..2....1..3..2..1..3....0..3..1..1..3
..2..2..3..3..1....2..0..3..1..0....2..2..0..3..1....2..0..0..2..2
CROSSREFS
Cf. A267278.
Sequence in context: A217322 A198700 A320094 * A015591 A078922 A199760
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 12 2016
STATUS
approved