The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A267330 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 southwest or northwest neighbors modulo n and the upper left element equal to 0. 0

%I #3 Jan 13 2016 08:13:55

%S 1,35,65,396,1929,8314,29393,99680,376803,1268170,4617875

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

%C Superdiagonal 2 of A267328.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267328.

%K nonn

%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 20 16:51 EDT 2024. Contains 372719 sequences. (Running on oeis4.)