OFFSET
0,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (14,-48).
FORMULA
a(n) = Sum_{k=1..n} 2^(n-1)*3^(n-k)*binomial(n,k). - Zerinvary Lajos, Sep 24 2006
From R. J. Mathar, Sep 18 2008: (Start)
a(n) = 4*8^n - 3*6^n = A081201(n+1).
Binomial transform of A081033. (End)
a(n) = 8*a(n-1) + 6^n. - Vincenzo Librandi, Feb 09 2011
a(0)=1, a(1)=14, a(n) = 14*a(n-1) - 48*a(n-2). - Harvey P. Dale, Dec 08 2011
E.g.f.: 4*exp(8*x) - 3*exp(6*x). - G. C. Greubel, Nov 10 2024
MAPLE
MATHEMATICA
CoefficientList[Series[1/((1-6x)(1-8x)), {x, 0, 30}], x] (* Harvey P. Dale, Dec 08 2011 *)
(* Alternative: *)
LinearRecurrence[{14, -48}, {1, 14}, 30] (* Harvey P. Dale, Dec 08 2011 *)
PROG
(PARI) Vec(1/((1-6*x)*(1-8*x))+O(x^99)) \\ Charles R Greathouse IV, Sep 24 2012
(Magma) [n le 2 select 14^(n-1) else 14*Self(n-1) -48*Self(n-2): n in [1..31]]; // G. C. Greubel, Nov 10 2024
(SageMath)
A016170=BinaryRecurrenceSequence(14, -48, 1, 14)
[A016170(n) for n in range(31)] # G. C. Greubel, Nov 10 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved
