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!)
A215045 a(n) = F(2*n+1)^5 with n >= 0, F=A000045 (Fibonacci numbers). 2
1, 32, 3125, 371293, 45435424, 5584059449, 686719856393, 84459630100000, 10387823949447757, 1277617458486664901, 157136551895768914976, 19326518128014212635057, 2377004590722802744140625, 292352238096435536675521568 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Index entries for linear recurrences with constant coefficients, signature (144,-2640,6930,-2640,144,-1).
FORMULA
O.g.f.: (1-x)*(1-111*x+1046*x^2-111*x^3+x^4)/((1-3*x+x^2)*(1-18*x+x^2)*(1-123*x+x^2)). From the odd part of the bisection of A056572.
MATHEMATICA
Table[Fibonacci[2*n+1]^5, {n, 0, 201}] (* Vincenzo Librandi, Sep 02 2012 *)
Fibonacci[Range[1, 35, 2]]^5 (* Harvey P. Dale, Apr 05 2019 *)
PROG
(Magma) [Fibonacci(2*n+1)^5: n in [0..15]] // Vincenzo Librandi, Sep 02 2012
CROSSREFS
Cf. A000045, A056572, A215044 (even part).
Sequence in context: A219228 A135787 A016793 * A219343 A123802 A264057
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Aug 31 2012
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 March 29 05:28 EDT 2024. Contains 371264 sequences. (Running on oeis4.)