|
%I #3 Jan 09 2016 09:04:19
%S 1,35,257,4835,172169,13122646,2166450939
%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 northeast or northwest neighbors modulo n and the upper left element equal to 0.
%C Superdiagonal 2 of A267019.
%e Some solutions for n=4
%e ..0..2..3..2..0..1....0..3..0..2..1..2....0..2..1..2..0..2....0..1..3..1..3..2
%e ..2..0..3..0..2..1....3..0..3..1..3..2....3..1..3..1..3..1....2..0..2..0..2..0
%e ..0..3..1..3..1..2....1..3..1..0..2..0....1..3..1..0..2..3....0..2..1..3..0..2
%e ..0..1..3..2..3..1....3..1..0..2..1..2....0..2..0..2..0..3....3..1..3..1..3..1
%Y Cf. A267019.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 09 2016
| 