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!)
A267555 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 or northeast neighbors modulo n and the upper left element equal to 0. 0
1, 35, 83, 350, 2165, 22189, 345443, 8164233, 287561285 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 2 of A267553.

LINKS

Table of n, a(n) for n=1..9.

EXAMPLE

Some solutions for n=4

..0..0..1..1..2..3....0..3..3..2..1..1....0..1..2..1..2..3....0..3..3..0..1..2

..1..1..1..2..3..3....0..3..3..2..1..1....1..2..2..2..3..0....0..0..0..1..2..2

..2..2..2..3..0..0....0..0..3..2..1..1....2..3..3..3..0..1....1..1..1..2..3..3

..3..2..3..0..0..1....0..0..3..2..2..2....3..0..0..0..1..1....2..1..2..3..0..3

CROSSREFS

Cf. A267553.

Sequence in context: A259282 A201068 A111144 * A201632 A044173 A044554

Adjacent sequences:  A267552 A267553 A267554 * A267556 A267557 A267558

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 17 2016

STATUS

approved

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 September 29 04:50 EDT 2022. Contains 357082 sequences. (Running on oeis4.)