The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267833 Number of nX3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0. 0
 1, 10, 91, 924, 10924, 147340, 2247540, 38338680, 723997540, 15008679840, 339055348800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column 3 of A267836. LINKS EXAMPLE Some solutions for n=4 ..0..0..3....0..3..1....0..0..1....0..1..2....0..2..3....0..0..1....0..3..1 ..1..0..1....0..1..2....1..1..3....1..2..3....2..3..1....0..2..3....0..1..1 ..1..2..2....1..2..2....2..3..2....2..3..0....0..2..0....2..3..1....2..2..2 ..3..3..2....3..3..0....0..3..2....0..1..3....3..1..1....3..1..2....3..3..0 CROSSREFS Cf. A267836. Sequence in context: A015455 A110410 A051789 * A015467 A144783 A227512 Adjacent sequences:  A267830 A267831 A267832 * A267834 A267835 A267836 KEYWORD nonn AUTHOR R. H. Hardin, Jan 21 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 8 08:54 EDT 2020. Contains 333313 sequences. (Running on oeis4.)