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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229638 Number of defective 3-colorings of a 2 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. 1
0, 6, 40, 122, 488, 1608, 5392, 17368, 55232, 172896, 535296, 1641376, 4992896, 15083648, 45297408, 135323008, 402405376, 1191699968, 3516119040, 10339711488, 30313351168, 88624646144, 258445856768, 751910639616, 2182836600832 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 6*a(n-1) - 6*a(n-2) - 16*a(n-3) + 12*a(n-4) + 24*a(n-5) + 8*a(n-6).

Empirical g.f.: 2*x^2*(1 - x)*(3 + 5*x - 36*x^2 + 10*x^3) / (1 - 2*x - 2*x^2)^3. - Colin Barker, Sep 20 2018

EXAMPLE

Some solutions for n=3:

..0..1..2....0..1..2....0..1..2....0..1..2....0..0..0....0..0..1....0..1..0

..0..1..1....2..0..0....2..0..1....1..1..2....1..2..1....1..0..1....1..1..2

CROSSREFS

Row 2 of A229637.

Sequence in context: A211065 A002595 A263956 * A210291 A089207 A318169

Adjacent sequences:  A229635 A229636 A229637 * A229639 A229640 A229641

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)