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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A223142 G.f. satisfies: A(x)^2 = A(x^2)^2 + 4*x. 2
 1, 2, 0, 0, 2, -4, 8, -16, 32, -56, 88, -112, 64, 240, -1264, 4064, -10814, 25500, -54200, 102832, -166020, 190808, 22304, -1058880, 4412424, -13496544, 35306480, -82326496, 172081840, -315115328, 464910368, -363016000, -871587808, 5713552456, -20289991016 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Paul D. Hanna, Table of n, a(n) for n = 0..500 FORMULA G.f.: A(x) = sqrt( 1 + Sum_{n>=0} 4*x^(2^n) ). EXAMPLE G.f.: A(x) = 1 + 2*x + 2*x^4 - 4*x^5 + 8*x^6 - 16*x^7 + 32*x^8 - 56*x^9 +... where A(x)^2 = 1 + 4*x + 4*x^2 + 4*x^4 + 4*x^8 + 4*x^16 + 4*x^32 +...+ 4*x^(2^n) +... PROG (PARI) {a(n)=local(A=1+x); for(i=1, #binary(n), A=(subst(A, x, x^2)^2+4*x+x*O(x^n))^(1/2)); polcoeff(A, n, x)} for(n=0, 40, print1(a(n), ", ")) CROSSREFS Cf. A223143, A107086, A223026. Sequence in context: A176787 A127862 A342223 * A244522 A292945 A024690 Adjacent sequences: A223139 A223140 A223141 * A223143 A223144 A223145 KEYWORD sign AUTHOR Paul D. Hanna, Mar 15 2013 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 10 00:12 EST 2023. Contains 367696 sequences. (Running on oeis4.)