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 A365158 #10 Aug 24 2023 07:48:35
%S A365158 1,3,30,352,4680,66852,1002420,15562917,248028012,4034367018,
%T A365158 66704722941,1117794312987,18942067925094,324048616144950,
%U A365158 5588890522700901,97074537335184054,1696556614819124517,29812650855663860436,526429300730659123740
%N A365158 G.f. satisfies A(x) = ( 1 + x*A(x)^2*(1 + x*A(x))^3 )^3.
%F A365158 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(s*k,n-k)/(n+k+1).
%o A365158 (PARI) a(n, s=3, t=3) = sum(k=0, n, binomial(t*(n+k+1), k)*binomial(s*k, n-k)/(n+k+1));
%Y A365158 Cf. A361305, A365157.
%K A365158 nonn
%O A365158 0,2
%A A365158 _Seiichi Manyama_, Aug 23 2023