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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022113 Fibonacci sequence beginning 2 7. 4
2, 7, 9, 16, 25, 41, 66, 107, 173, 280, 453, 733, 1186, 1919, 3105, 5024, 8129, 13153, 21282, 34435, 55717, 90152, 145869, 236021, 381890, 617911, 999801, 1617712, 2617513, 4235225, 6852738, 11087963, 17940701, 29028664, 46969365, 75998029, 122967394 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..36.

Tanya Khovanova, Recursive Sequences

Index to sequences with linear recurrences with constant coefficients, signature (1,1).

FORMULA

a(n) = a(n-1) + a(n-2). G.f.: -(5*x+2) / (x^2+x-1). - Colin Barker, Oct 18 2013

a(n) = ((5+6*sqrt(5))/5)*((1+sqrt(5))/2)^n + ((5-6*sqrt(5))/5)*((1-sqrt(5))/2)^n starting at n=0. [Bogart B. Strauss, Oct 27 2013]

MATHEMATICA

a={}; b=2; c=7; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 40}]; a (* Vladimir Orlovsky, Jul 23 2008 *)

PROG

(MAGMA) a0:=2; a1:=7; [GeneralizedFibonacciNumber(a0, a1, n): n in [0..40]]; // Bruno Berselli, Feb 12 2013

CROSSREFS

Cf. A000032.

Sequence in context: A185869 A020894 A165995 * A041643 A041395 A042345

Adjacent sequences:  A022110 A022111 A022112 * A022114 A022115 A022116

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 25 03:36 EDT 2014. Contains 240994 sequences.