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 A107095 #16 Jan 24 2025 18:27:30
%S A107095 0,1,2,-3,18,-150,1518,-17541,223782,-3087948,45470022,-707810715,
%T A107095 11569008816,-197540043324,3509923686678,-64697804055675,
%U A107095 1234127209128306,-24312707152663590,493834352052852738,-10327320248199824889,222086739445484152590
%N A107095 G.f. satisfies: A(A(x)) = (1+x)^2*A(x).
%F A107095 G.f.: A(x) = G(x)^2/x where G(x) is g.f. of A107096.
%F A107095 a(n) = T(n,1), where T(n,m)=sum(i=1..n-m, binomial(2*m,i)*T(n-i,m))-sum(k=m+1..n-1, T(n,k)*T(k,m)), n>m, T(n,n)=1. [_Vladimir Kruchinin_ May 03 2012]
%o A107095 (PARI) {a(n)=local(A,B,F);if(n<1,0,F=x+2*x^2+x*O(x^n);A=F; for(j=0,n, for(i=0,j,B=serreverse(A);A=(A+subst(B,x,A*(1+x)^2))/2); A=round(A));polcoeff(A,n,x))}
%o A107095 (Maxima) T(n,m):=if n=m then 1 else sum(binomial(2*m,i)*T(n-i,m),i,1,n-m)-sum(T(n,k)*T(k,m),k,m+1,n-1); makelist(T(n,1),n,0,10); /* _Vladimir Kruchinin_ May 03 2012 */
%Y A107095 Cf. A107096.
%K A107095 sign
%O A107095 0,3
%A A107095 _Paul D. Hanna_, May 12 2005