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 A365135 #8 Aug 23 2023 08:34:41
%S A365135 1,2,11,68,467,3418,26133,206264,1667908,13746476,115050074,975180582,
%T A365135 8354044986,72215867960,629139381448,5518236646614,48689379017014,
%U A365135 431868759238498,3848616161600778,34441553184113542,309390614528633311,2788841905397090626
%N A365135 G.f. satisfies A(x) = (1 + x*A(x)/(1 - x*A(x))^3)^2.
%F A365135 If g.f. satisfies A(x) = (1 + x*A(x)/(1 - x*A(x))^s)^t, then a(n) = (1/(n+1)) * Sum_{k=0..n} binomial(t*(n+1),k) * binomial(n+(s-1)*k-1,n-k).
%o A365135 (PARI) a(n, s=3, t=2) = sum(k=0, n, binomial(t*(n+1), k)*binomial(n+(s-1)*k-1, n-k))/(n+1);
%Y A365135 Cf. A161797, A365136.
%Y A365135 Cf. A006013.
%K A365135 nonn
%O A365135 0,2
%A A365135 _Seiichi Manyama_, Aug 23 2023