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 A365110 #9 Aug 22 2023 07:57:21
%S A365110 1,1,-3,3,11,-54,66,297,-1575,1980,10300,-55392,68352,403583,-2153685,
%T A365110 2551845,16999045,-89142087,99986901,750955382,-3850437018,4041467331,
%U A365110 34310059311,-171533033904,166630375248,1607168518073,-7821913867611,6950050797297
%N A365110 G.f. satisfies A(x) = 1 + x / (1 + x*A(x))^3.
%F A365110 If g.f. satisfies A(x) = 1 + x/(1 + x*A(x))^s, then a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n-k+1,k) * binomial(n+(s-1)*k-1,n-k)/(n-k+1).
%o A365110 (PARI) a(n, s=3) = sum(k=0, n, (-1)^(n-k)*binomial(n-k+1, k)*binomial(n+(s-1)*k-1, n-k)/(n-k+1));
%Y A365110 Cf. A007440, A365109, A365111, A365112.
%Y A365110 Cf. A365086.
%K A365110 sign
%O A365110 0,3
%A A365110 _Seiichi Manyama_, Aug 22 2023