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 A367282 #9 Nov 12 2023 04:35:59
%S A367282 1,1,4,18,94,527,3108,18993,119214,763997,4978304,32883853,219690066,
%T A367282 1481858835,10078051830,69030877581,475795428158,3297527987794,
%U A367282 22965847261928,160649189379029,1128201207643744,7951399289858530,56222323349767666
%N A367282 G.f. satisfies A(x) = 1 + x*A(x)^2 * (1 + x*A(x)^2)^2.
%F A367282 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 A367282 (PARI) a(n, s=2, 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 A367282 Cf. A002293, A073155, A214372, A367283.
%Y A367282 Cf. A000108, A367258.
%Y A367282 Cf. A367237.
%K A367282 nonn
%O A367282 0,3
%A A367282 _Seiichi Manyama_, Nov 12 2023