This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2017 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!)
 A022372 Fibonacci sequence beginning 2, 20. 2
 2, 20, 22, 42, 64, 106, 170, 276, 446, 722, 1168, 1890, 3058, 4948, 8006, 12954, 20960, 33914, 54874, 88788, 143662, 232450, 376112, 608562, 984674, 1593236, 2577910, 4171146, 6749056, 10920202 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS G. C. Greubel, 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+18*x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008 a(n) = 2*(Fibonacci(n+2) + 8*Fibonacci(n)). - G. C. Greubel, Aug 27 2017 a(n) = 2*A022100(n). - Alois P. Heinz, Aug 27 2017 MATHEMATICA a={}; b=2; c=20; 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 18 2008 *) Table[2*(Fibonacci[n + 2] + 8*Fibonacci[n]), {n, 0, 50}] (* or *) LinearRecurrence[{1, 1}, {2, 20}, 50] (* G. C. Greubel, Aug 27 2017 *) PROG (PARI) for(n=0, 50, print1(2*(fibonacci(n+2) + 8*fibonacci(n)), ", ")) \\ G. C. Greubel, Aug 27 2017 CROSSREFS Cf. A022100. Sequence in context: A111193 A136906 A260570 * A112405 A136885 A136909 Adjacent sequences:  A022369 A022370 A022371 * A022373 A022374 A022375 KEYWORD nonn 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 10 13:02 EST 2018. Contains 318048 sequences. (Running on oeis4.)