The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A207972 Expansion of g.f.: exp( Sum_{n>=1} 5*Fibonacci(n^2) * x^n/n ). 5
1, 5, 20, 115, 1665, 82650, 12847310, 5620114060, 6659421195205, 21082748688390045, 177217804775828062850, 3941798437750184226876305, 231505293200405380457355524620, 35848160499603817968830380832049915, 14619744406297572472084577939841875791890 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Moss and Ward prove that this is an integral sequence. - Peter Bala, Nov 28 2022
Let A(x) be the g.f. for this sequence. Note that the expansion of A(x)^(1/5) = exp( Sum_{n>=1} Fibonacci(n^2) * x^n/n ) does not have integer coefficients.
LINKS
Patrick Moss and Tom Ward, Fibonacci along even powers is (almost) realizable, arXiv:2011.13068 [math.NT], 2020; Fibonacci Quart. 60 (2022), no. 1, 40-47.
EXAMPLE
G.f.: A(x) = 1 + 5*x + 20*x^2 + 115*x^3 + 1665*x^4 + 82650*x^5 + ...
such that
log(A(x))/5 = x + 3*x^2/2 + 34*x^3/3 + 987*x^4/4 + 75025*x^5/5 + 14930352*x^6/6 + 7778742049*x^7/7 + ... + Fibonacci(n^2)*x^n/n + ...
PROG
(PARI) {a(n)=polcoeff(exp(sum(k=1, n, 5*fibonacci(k^2)*x^k/k)+x*O(x^n)), n)}
for(n=0, 16, print1(a(n), ", "))
CROSSREFS
Sequence in context: A300490 A020039 A319489 * A117736 A258665 A028944
KEYWORD
nonn,easy
AUTHOR
Paul D. Hanna, Feb 22 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 May 15 21:53 EDT 2024. Contains 372549 sequences. (Running on oeis4.)