OFFSET
0,1
COMMENTS
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-4).
FORMULA
a(n) = 4*a(n-1) - 2 for n=1,2,... , a(0) = 3.
a(n+1) = a(n) + A002042(n).
Binomial transform of A141495(n+1) = 3, 7, 21, ....
From Colin Barker, Jul 23 2019: (Start)
G.f.: (3 - 5*x) / ((1 - x)*(1 - 4*x)).
a(n) = 5*a(n-1) - 4*a(n-2) for n>1.
(End)
a(n+2) = a(n) + 35*A000302(n) for n=0,1,2, ... .
MATHEMATICA
LinearRecurrence[{5, -4}, {3, 10}, 30] (* Paolo Xausa, Nov 13 2023 *)
(2+7*4^Range[0, 30])/3 (* Harvey P. Dale, Aug 15 2025 *)
PROG
(PARI) a(n) = (2 + 7*4^n)/3; \\ Stefano Spezia, Jul 23 2019
(PARI) Vec((3 - 5*x) / ((1 - x)*(1 - 4*x)) + O(x^40)) \\ Colin Barker, Jul 23 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Jul 23 2019
EXTENSIONS
a(14)-a(25) from Stefano Spezia, Jul 23 2019
STATUS
approved
