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 A367285 #7 Nov 12 2023 04:36:30
%S A367285 1,1,5,26,159,1042,7185,51340,376806,2823734,21516113,166196703,
%T A367285 1298413089,10241803340,81454834164,652465062453,5259084437170,
%U A367285 42624217133130,347160390473763,2839928983316595,23323730673818467,192237734035157372,1589602164422747636
%N A367285 G.f. satisfies A(x) = 1 + x*A(x)^2 * (1 + x*A(x)^2)^3.
%F A367285 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(s*k,n-k) / (t*k+u*(n-k)+1).
%o A367285 (PARI) a(n, s=3, t=2, u=2) = sum(k=0, n, binomial(t*k+u*(n-k)+1, k)*binomial(s*k, n-k)/(t*k+u*(n-k)+1));
%Y A367285 Cf. A360076, A361305.
%Y A367285 Cf. A137953, A367261.
%Y A367285 Cf. A367240.
%K A367285 nonn
%O A367285 0,3
%A A367285 _Seiichi Manyama_, Nov 12 2023