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!)
A267331 Number of n X (n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,126,202,2516,39176,552162,6837388,77332028,812885568,8070454972,

%T 77792565998

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

%C Superdiagonal 3 of A267328.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267328.

%K nonn,more

%O 1,2

%A _R. H. Hardin_, Jan 13 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 May 26 04:43 EDT 2022. Contains 354074 sequences. (Running on oeis4.)