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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022123 Fibonacci sequence beginning 3, 11. 1
 3, 11, 14, 25, 39, 64, 103, 167, 270, 437, 707, 1144, 1851, 2995, 4846, 7841, 12687, 20528, 33215, 53743, 86958, 140701, 227659, 368360, 596019, 964379, 1560398, 2524777, 4085175, 6609952, 10695127, 17305079, 28000206, 45305285, 73305491, 118610776 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Table of n, a(n) for n=0..35. Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (1,1). FORMULA G.f.: (3+8*x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008 a(n) = 8*Fibonacci(n) + 3*Fibonacci(n+1). - Lechoslaw Ratajczak, Mar 14 2020 a(n) = a(n-1) + a(n-2). - Wesley Ivan Hurt, Jun 17 2021 MATHEMATICA a={}; b=3; c=11; 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}, {3, 11}, 40] (* Harvey P. Dale, Jan 27 2012 *) PROG (Magma) [8*Fibonacci(n) + 3*Fibonacci(n+1): n in [0..40]]; // Vincenzo Librandi, Mar 17 2020 CROSSREFS Cf. A000032, A000045. Sequence in context: A373955 A143029 A186701 * A303035 A273869 A289049 Adjacent sequences: A022120 A022121 A022122 * A022124 A022125 A022126 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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 16:46 EDT 2024. Contains 374552 sequences. (Running on oeis4.)