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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177377 G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^Fibonacci(n). 0
1, 1, 2, 4, 9, 22, 58, 164, 497, 1621, 5749, 22572, 100753, 528778, 3376927, 26917694, 270793597, 3438163325, 54872573755, 1096972396453, 27415834320206, 855886182233279, 33367897950658859, 1624569696575576124 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..23.

EXAMPLE

G.f.: A(x) = 1 + x + 2*x^2 + 4*x^3 + 9*x^4 + 22*x^5 + 58*x^6 +...

A(x) = 1 + x*A(x) + x^2*A(x) + x^3*A(x)^2 + x^4*A(x)^3 + x^5*A(x)^5 + x^6*A(x)^8 + x^7*A(x)^13 + x^8*A(x)^21 + x^9*A(x)^34 + x^10*A(x)^55 +...

PROG

(PARI) {a(n)=local(A=1+x); for(i=1, n, A=sum(k=0, n, x^k*(A+x*O(x^n))^fibonacci(k))); polcoeff(A, n)}

CROSSREFS

Cf. A000045.

Sequence in context: A024427 A171367 A092920 * A321994 A035053 A000571

Adjacent sequences:  A177374 A177375 A177376 * A177378 A177379 A177380

KEYWORD

nonn

AUTHOR

Paul D. Hanna, May 07 2010

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 09:59 EDT 2021. Contains 343174 sequences. (Running on oeis4.)