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

A267281
Number of nX(n+2) arrays of permutations of n+2 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, 35, 574, 12214, 330969, 12954512, 912215513
OFFSET
1,2
COMMENTS
Superdiagonal 2 of A267278.
EXAMPLE
Some solutions for n=4
..0..0..0..1..1..2....0..2..1..0..3..1....0..0..2..2..3..3....0..3..2..1..3..2
..3..0..1..1..2..2....1..1..3..2..0..3....3..1..1..2..2..3....3..1..0..2..1..3
..3..0..0..2..2..3....0..2..2..3..2..0....0..0..1..1..3..2....1..3..2..0..3..1
..3..3..1..1..3..2....1..1..3..2..0..3....0..0..1..2..1..3....2..1..0..2..0..0
CROSSREFS
Cf. A267278.
Sequence in context: A219370 A278674 A219468 * A114342 A208617 A010951
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 12 2016
STATUS
approved