login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267330 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 southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
1, 35, 65, 396, 1929, 8314, 29393, 99680, 376803, 1268170, 4617875 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 2 of A267328.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267328.

Sequence in context: A292081 A162832 A224485 * A229357 A254364 A146207

Adjacent sequences:  A267327 A267328 A267329 * A267331 A267332 A267333

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 07:08 EDT 2019. Contains 327253 sequences. (Running on oeis4.)