login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A229582
Number of defective 3-colorings of an n X 4 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
1
6, 116, 1620, 19764, 224532, 2440692, 25745364, 265720500, 2697594516, 27033340788, 268094978388, 2636009007156, 25732468879380, 249667710249204, 2409688805255892, 23151313964420532, 221538858133842324
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 18*a(n-1) - 81*a(n-2) for n>3.
Conjectures from Colin Barker, Sep 19 2018: (Start)
G.f.: 2*x*(3 + 4*x + 9*x^2) / (1 - 9*x)^2.
a(n) = 4 * 9^(n - 2) * (16*n - 3) for n>1.
(End)
EXAMPLE
Some solutions for n=3:
..0..1..0..1....0..1..1..2....0..1..0..2....0..1..2..1....0..1..2..0
..0..2..1..2....0..2..0..2....0..1..0..2....0..1..0..1....1..0..1..0
..1..0..1..0....0..2..1..0....1..2..1..2....1..2..0..2....1..2..1..0
CROSSREFS
Column 4 of A229586.
Sequence in context: A278752 A003425 A052465 * A113015 A362765 A024275
KEYWORD
nonn
AUTHOR
R. H. Hardin, Sep 26 2013
STATUS
approved