OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1, 1).
FORMULA
G.f.: (3 + 11*x)/(1 - x - x^2). - Philippe Deléham, Nov 19 2008
a(n) = h*Fibonacci(n+k) + Fibonacci(n+k-h) with h=6, k=2. - Bruno Berselli, Feb 20 2017
From Colin Barker, Feb 20 2017: (Start)
a(n) = (2^(-1-n)*((1-sqrt(5))^n*(-25+3*sqrt(5)) + (1+sqrt(5))^n*(25+3*sqrt(5)))) / sqrt(5).
a(n) = a(n-1) + a(n-2) for n>1.
(End)
a(n) = Lucas(n+4) + Lucas(n-3). - Greg Dresden and Kathleen Wilson, Feb 28 2022
MATHEMATICA
LinearRecurrence[{1, 1}, {3, 14}, 40] (* Harvey P. Dale, Oct 24 2013 *)
PROG
(PARI) Vec((3 + 11*x) / (1 - x - x^2) + O(x^50)) \\ Colin Barker, Feb 20 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved