This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A138590 a(n) = Fibonacci(9*n). 2
 0, 34, 2584, 196418, 14930352, 1134903170, 86267571272, 6557470319842, 498454011879264, 37889062373143906, 2880067194370816120, 218922995834555169026, 16641027750620563662096, 1264937032042997393488322, 96151855463018422468774568 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Colin Barker, Table of n, a(n) for n = 0..500 Index entries for linear recurrences with constant coefficients, signature (76,1). FORMULA a(n) = 34*A049669(n). G.f.: -34*x / ( -1+76*x+x^2 ). - R. J. Mathar, Sep 30 2013 From Colin Barker, Apr 06 2017: (Start) a(n) = ((-38 - 17*sqrt(5))^(-n)*(-1 + (-2889 - 1292*sqrt(5))^n)) / sqrt(5). a(n) = 76*a(n-1) + a(n-2) for n > 1. (End) MATHEMATICA Table[Fibonacci[n], {n, 0, 200, 9}] (* Vladimir Joseph Stephan Orlovsky, May 21 2011 *) PROG (MuPAD) numlib::fibonacci(9*n) \$ n = 0..25; (MAGMA) [Fibonacci(9*n): n in [0..50]]; // Vincenzo Librandi, Apr 20 2011 (PARI) concat(0, Vec(34*x / (1 - 76*x - x^2) + O(x^30))) \\ Colin Barker, Apr 06 2017 CROSSREFS Cf. A000045, A049669. Sequence in context: A187591 A160471 A252709 * A069223 A258499 A218718 Adjacent sequences:  A138587 A138588 A138589 * A138591 A138592 A138593 KEYWORD nonn,easy AUTHOR Zerinvary Lajos, May 13 2008 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 January 18 13:38 EST 2019. Contains 319271 sequences. (Running on oeis4.)