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 A367240 #8 Nov 11 2023 08:45:09
%S A367240 1,1,5,29,192,1372,10314,80390,643774,5264984,43788393,369221844,
%T A367240 3149085162,27119598885,235495141963,2059677411141,18127763268114,
%U A367240 160433599528417,1426870597505859,12746368353418175,114316604199957112,1028937342955189009
%N A367240 G.f. satisfies A(x) = 1 + x*A(x)^2 / (1 - x*A(x)^2)^3.
%F A367240 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 A367240 (PARI) a(n, s=3, t=2, u=2) = 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 A367240 Cf. A001764, A367239, A367241.
%K A367240 nonn
%O A367240 0,3
%A A367240 _Seiichi Manyama_, Nov 11 2023