cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A143047 G.f. A(x) satisfies A(x) = 1 + x*A(-x)^4.

Original entry on oeis.org

1, 1, -4, -10, 84, 265, -2604, -8900, 94692, 337940, -3767312, -13812674, 158785964, 593029550, -6967201736, -26372738120, 314904180100, 1204230041900, -14560722724912, -56130528427400, 685514219386576, 2659770565898729, -32749512944380172
Offset: 0

Views

Author

Paul D. Hanna, Jul 19 2008

Keywords

Examples

			A(x) = 1 + x - 4*x^2 - 10*x^3 + 84*x^4 + 265*x^5 - 2604*x^6 - 8900*x^7 +...
A(x)^4 = 1 + 4*x - 10*x^2 - 84*x^3 + 265*x^4 + 2604*x^5 - 8900*x^6 -...
A(x)^5 = 1 + 5*x - 10*x^2 - 120*x^3 + 265*x^4 + 3906*x^5 - 8900*x^6 -...
Note that a bisection of A^5 equals a bisection of A^4.
		

Crossrefs

Programs

  • PARI
    a(n)=local(A=x+x*O(x^n));for(i=0,n,A=1+x*subst(A,x,-x)^4);polcoeff(A,n)

Formula

G.f. satisfies: A(x) = 1 + x*(1 - x*A(x)^4)^4.
G.f. satisfies: [A(x)^5 + A(-x)^5]/2 = [A(x)^4 + A(-x)^4]/2.
a(0) = 1; a(n) = (-1)^(n-1) * Sum_{i, j, k, l>=0 and i+j+k+l=n-1} a(i) * a(j) * a(k) * a(l). - Seiichi Manyama, Jul 08 2025