|
%I #3 Jan 12 2016 16:03:07
%S 1,462,13767,741057,79348962,13687472182
%N Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.
%C Superdiagonal 4 of A267278.
%e Some solutions for n=3
%e ..0..0..0..1..2..2..0....0..1..2..0..0..1..2....0..0..1..1..2..2..0
%e ..0..0..1..1..1..2..0....1..1..2..2..0..1..2....0..1..1..2..2..0..0
%e ..2..1..1..1..2..2..2....0..1..2..0..0..1..2....1..0..2..1..2..2..1
%Y Cf. A267278.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 12 2016
| 