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.
%I A223143 #9 Nov 02 2024 04:06:40
%S A223143 1,3,-6,27,-141,819,-5022,31968,-209202,1398420,-9505854,65499759,
%T A223143 -456410943,3210397173,-22763553876,162524220984,-1167359075781,
%U A223143 8429107868541,-61148608627518,445450238075655,-3257116365714831,23896262127268719,-175854177039133998
%N A223143 G.f. satisfies: A(x)^3 = A(x^2)^3 + 9*x.
%H A223143 Paul D. Hanna, <a href="/A223143/b223143.txt">Table of n, a(n) for n = 0..300</a>
%F A223143 G.f.: A(x) = ( 1 + Sum_{n>=0} 9*x^(2^n) )^(1/3).
%e A223143 G.f.: A(x) = 1 + 3*x - 6*x^2 + 27*x^3 - 141*x^4 + 819*x^5 - 5022*x^6 +...
%e A223143 where
%e A223143 A(x)^3 = 1 + 9*x + 9*x^2 + 9*x^4 + 9*x^8 + 9*x^16 + 9*x^32 +...+ 9*x^(2^n) +...
%o A223143 (PARI) {a(n)=local(A=1+x); for(i=1, #binary(n), A=(subst(A, x, x^2)^3+9*x+x*O(x^n))^(1/3)); polcoeff(A, n, x)}
%o A223143 for(n=0,30,print1(a(n),", "))
%Y A223143 Cf. A223142, A107086, A223026.
%K A223143 sign
%O A223143 0,2
%A A223143 _Paul D. Hanna_, Mar 15 2013