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!)
A267280 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 southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
1, 10, 109, 1138, 18276, 663855, 55479601, 12194740046 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Superdiagonal 1 of A267278.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267278.

Sequence in context: A217322 A198700 A320094 * A015591 A078922 A199760

Adjacent sequences:  A267277 A267278 A267279 * A267281 A267282 A267283

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 12 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 20 06:18 EDT 2022. Contains 353852 sequences. (Running on oeis4.)