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 A365150 #21 Dec 02 2024 09:50:32
%S A365150 1,1,5,26,150,925,5967,39772,271758,1893431,13400897,96078789,
%T A365150 696333585,5093266409,37549674939,278739057687,2081637677823,
%U A365150 15628794649931,117897848681271,893167062280029,6792410218680749,51835002735642287,396821349652564273
%N A365150 G.f. satisfies A(x) = 1 + x*A(x)^2 / (1 - x*A(x))^3.
%F A365150 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(n+(s-1)*k-1,n-k)/(n+k+1).
%F A365150 G.f.: (1/x) * Series_Reversion( x*(1 - x/(1 - x)^3) ). - _Seiichi Manyama_, Sep 24 2024
%o A365150 (PARI) a(n, s=3, t=1) = sum(k=0, n, binomial(t*(n+k+1), k)*binomial(n+(s-1)*k-1, n-k)/(n+k+1));
%Y A365150 Cf. A001003, A011270.
%Y A365150 Cf. A365151, A365152.
%Y A365150 Cf. A052529.
%K A365150 nonn
%O A365150 0,3
%A A365150 _Seiichi Manyama_, Aug 23 2023