This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A107099 G.f. satisfies: A(A(x)) = x + 4*x^3, where A(x) = Sum_{n>=0} a(n)*x^(2*n+1). 1
 0, 1, 2, -6, 36, -266, 2028, -13596, 50088, 566694, -16598580, 232284876, -1912070088, 631155132, 239439857272, -2781218767224, -17362458802992, 795693633448710, -458070639409908, -335724554310292548, 4520379769156382616, 109439050270732883028, -3828757746830590219608 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Coefficients [x^n] A(x) = 0 (mod 3) except at n = 3^k (conjecture). LINKS EXAMPLE A(x) = 1*x + 2*x^3 - 6*x^5 + 36*x^7 - 266*x^9 + 2028*x^11 - 13596*x^13 +-... PROG (PARI) {a(n)=local(A, B, F); F=x+4*x^3+x*O(x^n); A=F; if(n==0, 0, for(i=0, n, B=serreverse(A); A=(A+subst(B, x, F))/2); polcoeff(A, n, x))} CROSSREFS Cf. A027436, A097090. Sequence in context: A060178 A096939 A162697 * A143021 A007657 A234235 Adjacent sequences:  A107096 A107097 A107098 * A107100 A107101 A107102 KEYWORD sign AUTHOR Paul D. Hanna, May 13 2005 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.

Last modified October 17 18:58 EDT 2019. Contains 328127 sequences. (Running on oeis4.)