login
Number of nX(n+1) arrays of permutations of n+1 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.
0

%I #3 Jan 13 2016 09:14:07

%S 1,10,11,45,264,2192,25661,418273,9498724

%N Number of nX(n+1) arrays of permutations of n+1 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 1 of A267338.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267338.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 13 2016