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 A365694 #17 Sep 16 2023 10:42:31
%S A365694 1,0,0,1,1,1,3,6,10,20,42,84,170,354,740,1549,3269,6945,14811,31711,
%T A365694 68177,147091,318313,690837,1503351,3279445,7169907,15708485,34482475,
%U A365694 75830981,167042763,368548926,814341362,1801867812,3992172298,8855912464,19668236110
%N A365694 G.f. satisfies A(x) = 1 + x^3*A(x)^2 / (1 - x*A(x)).
%F A365694 a(n) = Sum_{k=0..floor(n/3)} binomial(n-2*k-1,n-3*k) * binomial(n-k+1,k) / (n-k+1).
%F A365694 G.f.: A(x) = 2/(1 + x + sqrt(1 + x*(-2 + x - 4*x^2))). - _Vaclav Kotesovec_, Sep 16 2023
%t A365694 CoefficientList[Series[2/(1 + x + Sqrt[1 + x*(-2 + x - 4*x^2)]), {x, 0, 20}], x] (* _Vaclav Kotesovec_, Sep 16 2023 *)
%o A365694 (PARI) a(n) = sum(k=0, n\3, binomial(n-2*k-1, n-3*k)*binomial(n-k+1, k)/(n-k+1));
%Y A365694 Cf. A023426, A023432, A054514, A114997, A365695.
%Y A365694 Cf. A365243.
%K A365694 nonn
%O A365694 0,7
%A A365694 _Seiichi Manyama_, Sep 16 2023