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!)
A267565 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 west or southwest neighbors modulo n and the upper left element equal to 0. 0
1, 35, 141, 1614, 27712, 711359, 27767384, 1673476119 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 2 of A267562.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267562.

Sequence in context: A171473 A158586 A350205 * A330230 A330233 A220014

Adjacent sequences:  A267562 A267563 A267564 * A267566 A267567 A267568

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 August 10 08:49 EDT 2022. Contains 356039 sequences. (Running on oeis4.)