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!)
 A229696 Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. 1
 0, 40, 626, 5077, 35825, 230383, 1400413, 8184819, 46455457, 257724695, 1403839397, 7532391243, 39908047865, 209177764015, 1086276818845, 5595663437379, 28620024582289, 145460267764487, 735134318022101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Row 3 of A229694. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 15*a(n-1) - 81*a(n-2) + 185*a(n-3) - 162*a(n-4) + 60*a(n-5) - 8*a(n-6) for n > 10. EXAMPLE Some solutions for n=3:   0 1 0   0 1 0   0 1 1   0 0 1   0 1 0   0 1 0   0 1 0   0 1 1   2 0 0   1 2 0   0 2 0   1 2 0   0 1 2   2 0 2   2 1 0   2 1 2   0 2 1   0 1 2   1 1 2   1 2 1   1 1 0 CROSSREFS Sequence in context: A002847 A057808 A269778 * A247410 A183464 A189286 Adjacent sequences:  A229693 A229694 A229695 * A229697 A229698 A229699 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 23 20:42 EDT 2021. Contains 347617 sequences. (Running on oeis4.)