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 A365119 #7 Aug 22 2023 14:15:02
%S A365119 1,3,6,19,69,267,1093,4629,20142,89473,404076,1849746,8563558,
%T A365119 40025574,188612388,895115942,4274453904,20523807009,99025615998,
%U A365119 479874362583,2334582421497,11398055887003,55828060595832,274254002718255,1350907899813921,6670789629569022
%N A365119 G.f. satisfies A(x) = (1 + x / (1 - x*A(x)))^3.
%F A365119 If g.f. satisfies A(x) = (1 + x/(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).
%o A365119 (PARI) a(n, s=1, t=3) = sum(k=0, n, binomial(t*(n-k+1), k)*binomial(n+(s-1)*k-1, n-k)/(n-k+1));
%Y A365119 Cf. A001006, A365118.
%K A365119 nonn
%O A365119 0,2
%A A365119 _Seiichi Manyama_, Aug 22 2023