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”).

A210101
Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having one or three distinct values, and new values 0..2 introduced in row major order.
1
30, 225, 1690, 12725, 95830, 721705, 5435250, 40933565, 308275950, 2321665905, 17484765130, 131680019525, 991699197190, 7468614458425, 56247097997730, 423604143817805, 3190217398715550, 24025938366280065, 180942438158822650
OFFSET
1,1
COMMENTS
Column 2 of A210107.
LINKS
FORMULA
Empirical: a(n) = 8*a(n-1) - 3*a(n-2) - 4*a(n-3).
Conjectures from Colin Barker, Jul 14 2018: (Start)
G.f.: 5*x*(6 - 3*x - 4*x^2) / ((1 - x)*(1 - 7*x - 4*x^2)).
a(n) = (1/13)*2^(-2-n)*(13*2^(1+n) + (117-11*sqrt(65))*(7-sqrt(65))^n + (7+sqrt(65))^n*(117+11*sqrt(65))).
(End)
EXAMPLE
Some solutions for n=4:
0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 0 1 2 0 1 2
0 0 0 0 0 0 1 2 0 2 1 2 0 0 2 0 2 0 1 2 0
1 2 1 0 0 0 1 0 1 2 0 1 2 1 1 2 1 2 1 0 1
1 0 2 0 0 0 0 2 0 0 1 2 2 0 2 1 0 1 0 2 2
0 2 1 0 0 0 2 1 2 0 2 0 2 1 0 0 2 2 2 1 0
CROSSREFS
Cf. A210107.
Sequence in context: A076389 A342896 A189410 * A156372 A064241 A080569
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 17 2012
STATUS
approved