OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,2).
FORMULA
a(n+2) - a(n) = a(n+1) + a(n) = 15*2^n, n >= 0.
a(n) - 2*a(n-1) = period 2: repeat [3, -3], n > 0, a(0)=4, a(1)=11.
a(n+1) = 10*A051049(n) + period 2: repeat [1, 9].
a(n) = 12*2^n - A321483(n), n >= 0.
a(n) = 2^(n+2) + 3*A001045(n), n >= 0.
a(n) == A070366(n+4) (mod 9).
From Colin Barker, Dec 04 2018: (Start)
G.f.: (4 + 7*x) / ((1 + x)*(1 - 2*x)).
a(n) = a(n-1) + 2*a(n-2) for n > 1. (End)
E.g.f.: exp(-x)*(5*exp(3*x) - 1). - Elmo R. Oliveira, Aug 17 2024
MAPLE
[5*2^n-(-1)^n$n=0..30]; # Muniru A Asiru, Dec 05 2018
MATHEMATICA
a[n_] := 5*2^n - (-1)^n; Array[a, 30, 0] (* Amiram Eldar, Dec 03 2018 *)
PROG
(PARI) Vec((4 + 7*x) / ((1 + x)*(1 - 2*x)) + O(x^40)) \\ Colin Barker, Dec 04 2018
(GAP) List([0..30], n->5*2^n-(-1)^n); # Muniru A Asiru, Dec 05 2018
(Python) for n in range(0, 30): print(5*2**n - (-1)**n) # Stefano Spezia, Dec 05 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Dec 03 2018
STATUS
approved