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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 21:46 EST 2022. Contains 358543 sequences. (Running on oeis4.)