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!)
A267564 Number of nX(n+1) arrays of permutations of n+1 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, 10, 31, 170, 1326, 15686, 279070, 7353006, 284780894 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 1 of A267562.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267562.

Sequence in context: A342362 A161325 A187705 * A289201 A042849 A097236

Adjacent sequences:  A267561 A267562 A267563 * A267565 A267566 A267567

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 16 07:50 EDT 2022. Contains 356160 sequences. (Running on oeis4.)