login
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, southwest or northwest neighbors modulo n and the upper left element equal to 0.
0

%I #3 Jan 11 2016 21:16:10

%S 1,35,11,23,47,92,166,285,460,717,1068,1554,2187,3026,4082,5436

%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, southwest or northwest neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 2 of A267197.

%e Some solutions for n=4

%e ..0..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..0....0..1..1..2..3..3

%e ..1..1..2..3..0..0....1..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..3

%e ..1..2..2..3..0..1....1..1..2..3..3..0....1..1..2..3..3..0....0..1..2..2..3..0

%e ..2..2..3..3..0..1....1..2..2..3..0..0....1..2..2..3..3..0....0..1..2..2..3..0

%Y Cf. A267197.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 11 2016