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!)
A268119 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0. 0
1, 126, 414, 7396, 253472, 15303976, 1582675968, 276165720476 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Superdiagonal 3 of A268115.
LINKS
EXAMPLE
Some solutions for n=4
..0..0..0..1..2..2..3....0..0..0..1..1..2..3....0..1..1..2..2..2..3
..0..1..1..1..2..3..3....0..0..1..1..1..2..3....0..1..2..3..3..3..0
..0..1..2..2..2..3..0....0..1..2..2..2..3..3....1..1..2..3..3..0..0
..1..2..3..3..3..0..1....0..1..2..2..3..3..3....1..2..2..3..0..0..1
CROSSREFS
Cf. A268115.
Sequence in context: A323759 A102805 A267556 * A202406 A202399 A201467
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 26 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 April 23 14:49 EDT 2024. Contains 371914 sequences. (Running on oeis4.)