login
A267565
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 west or southwest neighbors modulo n and the upper left element equal to 0.
0
1, 35, 141, 1614, 27712, 711359, 27767384, 1673476119
OFFSET
1,2
COMMENTS
Superdiagonal 2 of A267562.
EXAMPLE
Some solutions for n=4
..0..1..1..2..2..3....0..1..2..3..0..1....0..0..1..2..2..3....0..1..2..3..3..0
..0..0..1..2..3..0....1..2..3..3..0..0....0..1..1..2..3..3....1..1..2..2..3..3
..0..1..2..2..3..3....1..2..2..3..3..0....0..0..1..2..3..3....0..1..2..2..3..0
..1..1..2..3..3..0....1..1..2..2..3..0....0..1..1..2..2..3....0..1..1..2..3..0
CROSSREFS
Cf. A267562.
Sequence in context: A171473 A158586 A350205 * A330230 A330233 A220014
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 17 2016
STATUS
approved