login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022114 Fibonacci sequence beginning 2 9. 5
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

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

MATHEMATICA

a={}; b=2; c=9; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 4!}]; a (* Vladimir Joseph Stephan Orlovsky, Sep 17 2008 *)

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

Cf. A000032.

Sequence in context: A043307 A049343 A131140 * A041099 A041581 A042463

Adjacent sequences:  A022111 A022112 A022113 * A022115 A022116 A022117

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 06:30 EST 2016. Contains 278749 sequences.