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 A087222 #14 Oct 11 2020 05:52:09
%S A087222 1,1,4,10,26,69,184,488,1294,3436,9116,24190,64190,170334,451994,
%T A087222 1199400,3182706,8445556,22410946,59469200,157806184,418751069,
%U A087222 1111188772,2948626472,7824411358,20762688580,55095420880,146200015984
%N A087222 G.f. satisfies A(x) = 1 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).
%F A087222 a(n) = A087221(3n).
%e A087222 Given f(x) = 1 + x + x^5 + x^21 + x^85 + x^341 + ...
%e A087222 so that f(x)^3 = 1 + 3x + 3x^2 + x^3 + 3x^5 + 6x^6 + 3x^7 + 3x^10 + ...
%e A087222 then A(x) = 1 + x*A(x)*(1 + 3x + 3x^2 + x^3 + 3x^5 + 6x^6 + ...)
%e A087222 = 1 + x + 4x^2 + 10x^3 + 26x^4 + 69x^5 + 184x^6 + ...
%t A087222 nmax = 30; CoefficientList[Series[1/(1 - Sum[x^((4^k - 1)/3), {k, 0, nmax}]^3*x), {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Oct 11 2020 *)
%o A087222 (PARI) a(n)=local(A,m); if(n<1,n==0,m=1; A=1+O(x); while(m<=3*n+3,m*=4; A=1/(1/subst(A,x,x^4)-x)); polcoeff(A,3*n))
%Y A087222 Cf. A087221, A087232, A087224.
%K A087222 nonn
%O A087222 0,3
%A A087222 _Paul D. Hanna_, Aug 27 2003