This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266653 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its northeast neighbor modulo n and the upper left element equal to 0. 0
 1, 2, 91, 14540, 5127134, 3413004556, 3833960867620, 6716778465903760, 17318905849792010100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column 3 of A266655. LINKS EXAMPLE Some solutions for n=4 ..0..3..0....0..3..2....0..0..2....0..3..0....0..3..3....0..3..2....0..3..0 ..1..3..2....3..1..2....0..2..3....1..2..1....3..1..0....3..2..0....3..3..2 ..2..1..1....0..2..3....2..3..1....2..1..0....1..2..2....0..2..1....2..1..2 ..0..3..2....0..1..1....1..3..1....3..2..3....0..1..2....1..1..3....1..1..0 CROSSREFS Cf. A266655. Sequence in context: A193747 A242176 A024240 * A116162 A116293 A030985 Adjacent sequences:  A266650 A266651 A266652 * A266654 A266655 A266656 KEYWORD nonn AUTHOR R. H. Hardin, Jan 02 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 December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)