The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266598 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north or northeast neighbor modulo n and the upper left element equal to 0. 0
 1, 0, 6, 964, 289569, 188978578, 207181732018, 357677449791820, 912613747687355713 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Column 3 of A266599. LINKS Table of n, a(n) for n=1..9. EXAMPLE Some solutions for n=4 ..0..3..0....0..0..1....0..1..2....0..2..3....0..2..2....0..0..2....0..1..0 ..2..2..2....0..3..3....0..1..1....0..1..1....2..1..1....2..0..1....3..3..3 ..1..1..0....3..2..2....3..0..3....3..0..3....0..1..0....2..3..1....2..1..2 ..1..3..3....1..1..2....2..2..3....2..2..1....3..3..3....1..3..3....1..0..2 CROSSREFS Cf. A266599. Sequence in context: A214638 A175554 A263423 * A250392 A145250 A332196 Adjacent sequences: A266595 A266596 A266597 * A266599 A266600 A266601 KEYWORD nonn AUTHOR R. H. Hardin, Jan 01 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.

Last modified September 29 13:57 EDT 2023. Contains 365771 sequences. (Running on oeis4.)