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 A365152 #13 Aug 24 2023 07:49:57
%S A365152 1,3,30,361,4887,71064,1084338,17127921,277691055,4594624095,
%T A365152 77271742056,1317037554924,22699836814548,394961294853852,
%U A365152 6928051002350154,122384261274499665,2175295243858562031,38875484049230706129,698131263508514451678
%N A365152 G.f. satisfies A(x) = ( 1 + x*A(x)^2 / (1 - x*A(x))^3 )^3.
%F A365152 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 A365152 (PARI) a(n, s=3, t=3) = sum(k=0, n, binomial(t*(n+k+1), k)*binomial(n+(s-1)*k-1, n-k)/(n+k+1));
%Y A365152 Cf. A365150, A365151.
%K A365152 nonn
%O A365152 0,2
%A A365152 _Seiichi Manyama_, Aug 23 2023