The OEIS is supported by the many generous donors to the OEIS Foundation.

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

`%I #3 Jan 12 2016 16:02:00
`

`%S 1,35,574,12214,330969,12954512,912215513
`

`%N 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.
`

`%C Superdiagonal 2 of A267278.
`

`%e Some solutions for n=4
`

`%e ..0..0..0..1..1..2....0..2..1..0..3..1....0..0..2..2..3..3....0..3..2..1..3..2
`

`%e ..3..0..1..1..2..2....1..1..3..2..0..3....3..1..1..2..2..3....3..1..0..2..1..3
`

`%e ..3..0..0..2..2..3....0..2..2..3..2..0....0..0..1..1..3..2....1..3..2..0..3..1
`

`%e ..3..3..1..1..3..2....1..1..3..2..0..3....0..0..1..2..1..3....2..1..0..2..0..0
`

`%Y Cf. A267278.
`

`%K nonn
`

`%O 1,2
`

`%A _R. H. Hardin_, Jan 12 2016
`