The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #3 Jan 17 2016 07:07:58
%S 1,35,141,1614,27712,711359,27767384,1673476119
%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 west or southwest neighbors modulo n and the upper left element equal to 0.
%C Superdiagonal 2 of A267562.
%e Some solutions for n=4
%e ..0..1..1..2..2..3....0..1..2..3..0..1....0..0..1..2..2..3....0..1..2..3..3..0
%e ..0..0..1..2..3..0....1..2..3..3..0..0....0..1..1..2..3..3....1..1..2..2..3..3
%e ..0..1..2..2..3..3....1..2..2..3..3..0....0..0..1..2..3..3....0..1..2..2..3..0
%e ..1..1..2..3..3..0....1..1..2..2..3..0....0..1..1..2..2..3....0..1..1..2..3..0
%Y Cf. A267562.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 17 2016