OFFSET
0,1
COMMENTS
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (6,-4).
FORMULA
a(n) = 6*a(n-1) - 4*a(n-2) for n > 1; a(0) = 2, a(1) = 11. [corrected by Harvey P. Dale, Aug 15 2013]
G.f.: (2-x)/(1-6*x+4*x^2).
a(n) = 2^(n-1) * A002878(n+1). - Diego Rattaggi, Jun 16 2020
a(n) = Sum_{k>=1} binomial(k+n-1,n) * A000032(k) / 2^(k+1). - Diego Rattaggi, Aug 02 2020
MATHEMATICA
LinearRecurrence[{6, -4}, {2, 11}, 30] (* Harvey P. Dale, Aug 15 2013 *)
CoefficientList[Series[(2 - x) / (1 - 6 x + 4 x^2), {x, 0, 30}], x] (* Vincenzo Librandi, Aug 16 2013 *)
PROG
(Magma) Z<x>:=PolynomialRing(Integers()); N<r>:=NumberField(x^2-5); S:=[ ((2+r)*(3+r)^n+(2-r)*(3-r)^n)/2: n in [0..20] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Jul 19 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Al Hakanson (hawkuu(AT)gmail.com), Jul 13 2009
EXTENSIONS
Edited and extended beyond a(5) by Klaus Brockhaus, Jul 19 2009
STATUS
approved