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 A367239 #8 Nov 11 2023 08:45:13
%S A367239 1,1,4,19,104,615,3829,24728,164122,1112641,7671781,53634389,
%T A367239 379305155,2708686547,19505022538,141470864166,1032587621470,
%U A367239 7578835132264,55901583657799,414157062713599,3080581445049863,22996511364853472,172230640045929990
%N A367239 G.f. satisfies A(x) = 1 + x*A(x) / (1 - x*A(x)^2)^3.
%F A367239 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 A367239 (PARI) a(n, s=3, t=1, 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 A367239 Cf. A001764, A367240, A367241.
%K A367239 nonn
%O A367239 0,3
%A A367239 _Seiichi Manyama_, Nov 11 2023