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!)
A267340 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 north, west or southwest neighbors modulo n and the upper left element equal to 0. 0
1, 10, 11, 45, 264, 2192, 25661, 418273, 9498724 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Superdiagonal 1 of A267338.
LINKS
EXAMPLE
Some solutions for n=4
..0..1..2..3..0....0..1..2..2..3....0..1..2..2..3....0..1..2..3..0
..1..2..2..3..0....0..1..2..3..3....0..1..2..3..0....1..2..3..0..1
..1..2..3..0..1....1..1..2..3..0....1..2..3..3..0....2..3..0..1..2
..2..3..3..0..1....1..2..3..0..0....1..2..3..0..1....3..0..1..2..3
CROSSREFS
Cf. A267338.
Sequence in context: A280203 A042395 A041210 * A344082 A042413 A041212
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 March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)