login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267022 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 northeast or northwest neighbors modulo n and the upper left element equal to 0. 0
1, 35, 257, 4835, 172169, 13122646, 2166450939 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 2 of A267019.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267019.

Sequence in context: A255584 A113941 A067238 * A145014 A090646 A220929

Adjacent sequences:  A267019 A267020 A267021 * A267023 A267024 A267025

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 09 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 30 23:06 EDT 2021. Contains 346365 sequences. (Running on oeis4.)