The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 Apr 14 2020 21:34:03
%S 1,3,5,12,36,135,649,4277,39472,505780,9112713
%N Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0.
%C Diagonal of A267338.
%e Some solutions for n=4
%e ..0..1..1..2....0..1..2..3....0..0..1..2....0..1..2..3....0..1..2..3
%e ..0..1..2..3....0..1..2..3....0..1..2..3....1..2..3..0....1..1..2..3
%e ..1..2..3..0....0..1..2..3....0..1..2..3....2..3..0..1....1..2..3..0
%e ..2..3..3..0....1..2..3..0....1..2..3..3....2..3..0..1....2..3..0..0
%Y Cf. A267338.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 13 2016