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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022368 Fibonacci sequence beginning 2, 12. 3
2, 12, 14, 26, 40, 66, 106, 172, 278, 450, 728, 1178, 1906, 3084, 4990, 8074, 13064, 21138, 34202, 55340, 89542, 144882, 234424, 379306, 613730, 993036, 1606766, 2599802, 4206568, 6806370, 11012938 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
G.f.: 2*(1+5*x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008
a(n) = 2*A022096(n). - R. J. Mathar, Sep 27 2014
a(n) = 2*(Fibonacci(n+2) + 4*Fibonacci(n)). - G. C. Greubel, Aug 27 2017
MATHEMATICA
a={}; b=2; c=12; 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] + 4*Fibonacci[n]), {n, 0, 50}] (* or *) LinearRecurrence[{1, 1}, {2, 12}, 50] (* G. C. Greubel, Aug 27 2017 *)
PROG
(PARI) for(n=0, 50, print1(2*(fibonacci(n+2) + 4*fibonacci(n)), ", ")) \\ G. C. Greubel, Aug 27 2017
CROSSREFS
Sequence in context: A108976 A073598 A232768 * A076484 A259128 A280942
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)