OFFSET
0,1
LINKS
Ivan Panchenko, 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.: (2+7*x)/(1-x-x^2). - Wesley Ivan Hurt, Jun 15 2014
a(n) = 10*F(n) + F(n-3). - J. M. Bergot, Jul 17 2017
a(n) = Fibonacci(n+5) - Lucas(n-2). - Greg Dresden and Christina Savory, Mar 01 2022
MATHEMATICA
LinearRecurrence[{1, 1}, {2, 9}, 40] (* Harvey P. Dale, Jul 16 2012 *)
CoefficientList[Series[(2 + 7 x)/(1 - x - x^2), {x, 0, 40}], x] (* Wesley Ivan Hurt, Jun 15 2014 *)
PROG
(Magma) a0:=2; a1:=9; [GeneralizedFibonacciNumber(a0, a1, n): n in [0..40]]; // Bruno Berselli, Feb 12 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 14 1998
STATUS
approved