The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #3 Jan 09 2016 09:03:52
%S 1,10,59,759,18157,912057,100710495
%N 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 northeast or northwest neighbors modulo n and the upper left element equal to 0.
%C Superdiagonal 1 of A267019.
%e Some solutions for n=4
%e ..0..1..3..1..0....0..1..3..1..3....0..2..1..3..0....0..2..0..2..0
%e ..2..0..2..0..2....2..0..1..3..1....3..1..3..1..3....2..0..3..1..2
%e ..1..3..1..3..1....0..2..0..2..3....2..3..2..0..1....1..3..1..3..1
%e ..3..2..3..2..0....2..1..2..0..3....0..2..0..2..1....3..2..0..1..3
%Y Cf. A267019.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 09 2016