|
%I #3 Jan 13 2016 20:10:07
%S 1,35,33,127,626,4189,38879,501695,9072793
%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 north, west or northeast neighbors modulo n and the upper left element equal to 0.
%C Superdiagonal 2 of A267392.
%e Some solutions for n=4
%e ..0..0..0..1..1..2....0..0..1..1..2..2....0..0..0..1..2..2....0..0..0..1..2..3
%e ..1..1..1..2..2..3....1..1..2..2..3..3....1..1..1..2..3..3....1..1..1..2..3..3
%e ..1..2..2..3..3..0....1..2..3..3..0..0....1..1..2..3..3..0....2..2..2..3..0..0
%e ..2..3..3..3..0..0....2..3..3..0..0..1....2..2..3..3..0..0....2..3..3..0..1..1
%Y Cf. A267392.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 13 2016
| 