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 A365157 #11 Aug 24 2023 07:48:30
%S A365157 1,2,15,124,1167,11772,124561,1363964,15326826,175739698,2047974619,
%T A365157 24185317182,288801732423,3481242975808,42303574158234,
%U A365157 517683469595912,6374096109874427,78909384182870688,981600144994348111,12263583888826309544,153812133876403777005
%N A365157 G.f. satisfies A(x) = ( 1 + x*A(x)^2*(1 + x*A(x))^3 )^2.
%F A365157 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 A365157 (PARI) a(n, s=3, t=2) = sum(k=0, n, binomial(t*(n+k+1), k)*binomial(s*k, n-k)/(n+k+1));
%Y A365157 Cf. A361305, A365158.
%K A365157 nonn
%O A365157 0,2
%A A365157 _Seiichi Manyama_, Aug 23 2023