login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022114 Fibonacci sequence beginning 2 9. 8
2, 9, 11, 20, 31, 51, 82, 133, 215, 348, 563, 911, 1474, 2385, 3859, 6244, 10103, 16347, 26450, 42797, 69247, 112044, 181291, 293335, 474626, 767961, 1242587, 2010548, 3253135, 5263683, 8516818, 13780501, 22297319, 36077820, 58375139, 94452959, 152828098 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
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
Sequence in context: A043307 A049343 A131140 * A041099 A041581 A042463
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 14 1998
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 12:58 EDT 2024. Contains 371913 sequences. (Running on oeis4.)