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 A367242 #8 Nov 11 2023 08:45:02
%S A367242 1,1,2,9,40,202,1068,5884,33356,193365,1140940,6829601,41372238,
%T A367242 253156085,1562416632,9714660195,60795387840,382639224327,
%U A367242 2420498032350,15380899180204,98134455984896,628425763698123,4037685422823604,26021345223509038,168164609160791154
%N A367242 G.f. satisfies A(x) = 1 + x / (1 - x*A(x)^3)^2.
%F A367242 If g.f. satisfies A(x) = 1 + x*A(x)^t / (1 - x*A(x)^u)^s, then a(n) = Sum_{k=0..n} binomial(t*k+u*(n-k)+1,k) * binomial(n+(s-1)*k-1,n-k) / (t*k+u*(n-k)+1).
%o A367242 (PARI) a(n, s=2, t=0, u=3) = sum(k=0, n, binomial(t*k+u*(n-k)+1, k)*binomial(n+(s-1)*k-1, n-k)/(t*k+u*(n-k)+1));
%Y A367242 Cf. A364742.
%K A367242 nonn
%O A367242 0,3
%A A367242 _Seiichi Manyama_, Nov 11 2023