The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143562 G.f. satisfies: A(x) = 1 + x*A(x)^3/A(-x)^2. 3
 1, 1, 5, 17, 105, 481, 3261, 16801, 119697, 656129, 4819061, 27447601, 205776121, 1202943457, 9152680109, 54524185409, 419491297313, 2534963932417, 19673179986661, 120224135048273, 939543098579081, 5793676726569697 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA G.f. satisfies: A(x) + A(-x) = 1 + (1+x^2)*A(x)*A(-x). G.f. satisfies: A(x) = Sum_{n>=0} x^n * A(x)^(2*n) / A(-x)^(2*n). G.f. satisfies: A(x) = exp( Sum_{n>=1} A(x)^(2*n)/A(-x)^(2*n) * x^n/n ). G.f.: A(x) = G(x)/(1+x^2) where G(x) = 1 + x*G(x)^3/G(-x)^3 is the g.f. of A143556. EXAMPLE G.f. A(x) = 1 + x + 5*x^2 + 17*x^3 + 105*x^4 + 481*x^5 + 3261*x^6 +... A(x)*A(-x) = 1 + 9*x^2 + 201*x^4 + 6321*x^6 + 233073*x^8 +... PROG (PARI) {a(n)=local(A=1+x*O(x^n)); for(i=0, n, A=1+x*A^3/subst(A^2, x, -x)); polcoeff(A, n)} CROSSREFS Cf. A143556, A143339. Sequence in context: A034821 A158007 A349011 * A261425 A297476 A235871 Adjacent sequences: A143559 A143560 A143561 * A143563 A143564 A143565 KEYWORD nonn AUTHOR Paul D. Hanna, Aug 24 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 15:01 EST 2022. Contains 358667 sequences. (Running on oeis4.)