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
1, 35, 24, 135, 1223, 18140, 413155, 14116549, 711260225 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 2 of A267338.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267338.

Sequence in context: A267402 A217408 A266057 * A174027 A259083 A244214

Adjacent sequences:  A267338 A267339 A267340 * A267342 A267343 A267344

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 13 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 May 17 03:43 EDT 2022. Contains 353727 sequences. (Running on oeis4.)