The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A051294 a(n) = F(n^2)/F(n), where F(n) = A000045(n) is the n-th Fibonacci number. 5
 1, 3, 17, 329, 15005, 1866294, 598364773, 505248088463, 1114384187445409, 6440451785077489365, 97415813466381445596089, 3858093084890921488916776332, 400009475456580321242184872389193, 108580324845164033411588204172311746011 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Clark Kimberling, Table of n, a(n) for n = 1..69 (all terms with <= 1000 digits) FORMULA a(n) = [x^(n-1)] 1/(1 - Lucas(n)*x + (-1)^n*x^2), where Lucas(n) = A000204(n). - Paul D. Hanna, Jan 28 2012 MAPLE with(combinat): seq((fibonacci(i^2)/fibonacci(i)), i=1..14); # Paolo P. Lava, Aug 22 2018 MATHEMATICA Table[Fibonacci[n^2]/Fibonacci[n], {n, 15}]  (* Harvey P. Dale, Apr 12 2011 *) PROG (PARI) a(n)=fibonacci(n^2)/fibonacci(n) (PARI) {Lucas(n)=fibonacci(n-1)+fibonacci(n+1)} {a(n)=polcoeff(1/(1-Lucas(n)*x+(-1)^n*x^2+x*O(x^n)), n-1)} /* Paul D. Hanna, Jan 28 2012 */ CROSSREFS Main diagonal of array A028412. Sequence in context: A271609 A290806 A009592 * A192556 A144033 A098138 Adjacent sequences:  A051291 A051292 A051293 * A051295 A051296 A051297 KEYWORD easy,nonn AUTHOR EXTENSIONS More terms from Benoit Cloitre, Jan 05 2003 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 August 3 20:08 EDT 2020. Contains 336201 sequences. (Running on oeis4.)