The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #3 Jan 13 2016 09:15:01
%S 1,126,77,388,4462,96291,3534075,214106961
%N Number of nX(n+3) arrays of permutations of n+3 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 Superdiagonal 3 of A267338.
%e Some solutions for n=4
%e ..0..0..1..2..3..3..0....0..1..1..2..2..2..3....0..1..2..3..3..0..1
%e ..0..1..1..2..3..3..0....0..1..1..2..2..3..3....1..2..3..3..0..1..2
%e ..1..1..2..2..3..3..0....0..1..1..2..3..3..0....2..3..3..0..0..1..2
%e ..1..2..2..2..3..0..1....0..1..2..3..3..0..0....2..3..0..0..1..1..2
%Y Cf. A267338.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 13 2016