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!)
A229633 Number of defective 3-colorings of an n X 4 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. 1
3, 122, 1109, 10227, 89331, 747299, 6049298, 47723226, 368769958, 2801445986, 20980532622, 155235487082, 1136689596246, 8248224017298, 59378458285438, 424468785559258, 3015393888558342, 21301249097825858, 149716107860461294 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

Empirical: a(n) = 21*a(n-1) - 159*a(n-2) + 511*a(n-3) - 636*a(n-4) + 336*a(n-5) - 64*a(n-6) for n>9.

Empirical g.f.: x*(3 + 59*x - 976*x^2 + 4803*x^3 - 9539*x^4 + 7326*x^5 - 1825*x^6 - 76*x^7 + 25*x^8) / (1 - 7*x + 4*x^2)^3. - Colin Barker, Sep 20 2018

EXAMPLE

Some solutions for n=3:

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

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

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

CROSSREFS

Column 4 of A229637.

Sequence in context: A301559 A141440 A156001 * A171357 A209363 A012569

Adjacent sequences:  A229630 A229631 A229632 * A229634 A229635 A229636

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 17 23:37 EST 2020. Contains 330995 sequences. (Running on oeis4.)