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

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022115 Fibonacci sequence beginning 2, 11. 3
2, 11, 13, 24, 37, 61, 98, 159, 257, 416, 673, 1089, 1762, 2851, 4613, 7464, 12077, 19541, 31618, 51159, 82777, 133936, 216713, 350649, 567362, 918011, 1485373, 2403384, 3888757, 6292141, 10180898, 16473039, 26653937, 43126976, 69780913, 112907889, 182688802 (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

Clark Kimberling, Problem Proposals, The Fibonacci Quarterly, vol. 52 #5, 2015, p5-14.

Index entries for linear recurrences with constant coefficients, signature (1,1).

FORMULA

G.f.: (2+9*x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008

a(n) = 12*F(n) + F(n-3). - J. M. Bergot, Jul 20 2017

MATHEMATICA

CoefficientList[Series[(2 + 9 x)/(1 - x - x^2), {x, 0, 40}], x] (* Wesley Ivan Hurt, Jun 15 2014 *)

CROSSREFS

Cf. A000032.

Sequence in context: A045385 A090416 A090430 * A042453 A041885 A247338

Adjacent sequences:  A022112 A022113 A022114 * A022116 A022117 A022118

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 August 18 08:18 EDT 2017. Contains 290685 sequences.