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!)
A267341 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 north, west or southwest neighbors modulo n and the upper left element equal to 0. 0

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

%S 1,35,24,135,1223,18140,413155,14116549,711260225

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

%C Superdiagonal 2 of A267338.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267338.

%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 April 24 12:31 EDT 2024. Contains 371937 sequences. (Running on oeis4.)