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!)
 A229683 Number of defective 3-colorings of an nX6 0..2 array connected diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order 1
 0, 17280, 959040, 35485776, 1138164048, 33555543408, 937213830720, 25175909234736, 656711865897408, 16739441074986336, 418806827449472592, 10318185686783039760, 250943458030201728144, 6036117745064710768416 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column 6 of A229685 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 75*a(n-1) -2010*a(n-2) +19486*a(n-3) +60075*a(n-4) -2206575*a(n-5) +7404210*a(n-6) +70536825*a(n-7) -435322350*a(n-8) -601275555*a(n-9) +8082823950*a(n-10) -6257717775*a(n-11) -54520532190*a(n-12) +92909172825*a(n-13) +132368667075*a(n-14) -366499782594*a(n-15) +470715894135*a(n-17) -282429536481*a(n-18) for n>20 EXAMPLE Some solutions for n=3 ..0..1..1..0..1..2....0..1..1..0..1..0....0..1..1..0..1..0....0..0..1..0..2..0 ..2..0..2..2..1..0....2..0..0..0..1..0....2..0..0..0..2..0....0..0..2..0..2..0 ..1..1..1..0..2..2....1..1..2..2..2..0....2..1..2..1..2..0....1..1..2..0..2..0 CROSSREFS Sequence in context: A094413 A209967 A093790 * A228379 A230164 A001381 Adjacent sequences:  A229680 A229681 A229682 * A229684 A229685 A229686 KEYWORD nonn AUTHOR R. H. Hardin Sep 27 2013 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 September 24 17:09 EDT 2020. Contains 337321 sequences. (Running on oeis4.)