login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267556 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 northeast neighbors modulo n and the upper left element equal to 0. 0

%I #3 Jan 17 2016 06:33:17

%S 1,126,410,2437,21835,326500,7589059,271504873

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

%C Superdiagonal 3 of A267553.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267553.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 17 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)