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 A365151 #13 Aug 24 2023 07:49:54
%S A365151 1,2,15,130,1263,13158,143704,1623766,18824931,222670678,2676674916,
%T A365151 32604377358,401567277063,4992440157784,62569729324806,
%U A365151 789679959184598,10027614784648750,128024712530277906,1642407060905790817,21161202394988206098
%N A365151 G.f. satisfies A(x) = ( 1 + x*A(x)^2 / (1 - x*A(x))^3 )^2.
%F A365151 If g.f. satisfies A(x) = ( 1 + x*A(x)^2 / (1 - x*A(x))^s )^t, then a(n) = Sum_{k=0..n} binomial(t*(n+k+1),k) * binomial(n+(s-1)*k-1,n-k)/(n+k+1).
%o A365151 (PARI) a(n, s=3, t=2) = sum(k=0, n, binomial(t*(n+k+1), k)*binomial(n+(s-1)*k-1, n-k)/(n+k+1));
%Y A365151 Cf. A365150, A365152.
%K A365151 nonn
%O A365151 0,2
%A A365151 _Seiichi Manyama_, Aug 23 2023