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 A365113 #9 Aug 22 2023 07:57:31
%S A365113 1,1,3,9,31,114,438,1739,7077,29364,123756,528324,2279868,9928679,
%T A365113 43580301,192601419,856317717,3827501985,17188943523,77521747638,
%U A365113 350959738842,1594390493067,7266093316649,33209221327752,152182572790008,699083290518817,3218624408121555
%N A365113 G.f. satisfies A(x) = 1 + x / (1 - x*A(x))^3.
%F A365113 If g.f. satisfies A(x) = 1 + x/(1 - x*A(x))^s, then a(n) = Sum_{k=0..n} binomial(n-k+1,k) * binomial(n+(s-1)*k-1,n-k)/(n-k+1).
%o A365113 (PARI) a(n, s=3) = sum(k=0, n, binomial(n-k+1, k)*binomial(n+(s-1)*k-1, n-k)/(n-k+1));
%Y A365113 Cf. A000108, A365114, A365115.
%Y A365113 Cf. A161797, A365110.
%K A365113 nonn
%O A365113 0,3
%A A365113 _Seiichi Manyama_, Aug 22 2023