This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268119 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,126,414,7396,253472,15303976,1582675968,276165720476

%N Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 3 of A268115.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A268115.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 26 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 05:03 EDT 2019. Contains 323508 sequences. (Running on oeis4.)