This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022136 Fibonacci sequence beginning 5, 11. 6
 5, 11, 16, 27, 43, 70, 113, 183, 296, 479, 775, 1254, 2029, 3283, 5312, 8595, 13907, 22502, 36409, 58911, 95320, 154231, 249551, 403782, 653333, 1057115, 1710448, 2767563, 4478011, 7245574, 11723585, 18969159, 30692744, 49661903, 80354647, 130016550 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, 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.: (5+6*x)/(1-x-x^2). - Philippe Deléham, Nov 20 2008 a(n) = 2*Lucas(n-1) + 7*Fibonacci(n+1). - Lechoslaw Ratajczak, May 01 2017 MATHEMATICA a={}; b=5; c=11; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 40, 1}]; a (* Vladimir Joseph Stephan Orlovsky, Jul 23 2008 *) Transpose[NestList[{Last[#], Total[#]}&, {5, 11}, 40]][[1]]  (* Harvey P. Dale, Apr 04 2011 *) LinearRecurrence[{1, 1}, {5, 11}, 40] (* Vincenzo Librandi, May 03 2017 *) CROSSREFS Cf. A000032, A000045. Sequence in context: A314181 A314182 A035108 * A042385 A041046 A041117 Adjacent sequences:  A022133 A022134 A022135 * A022137 A022138 A022139 KEYWORD nonn,easy AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 19 08:25 EST 2018. Contains 318245 sequences. (Running on oeis4.)