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 A365698 #14 Sep 16 2023 12:02:22
%S A365698 1,0,0,0,0,1,1,1,1,1,1,2,4,7,11,16,22,31,47,76,126,207,331,517,801,
%T A365698 1251,1987,3206,5212,8465,13677,21997,35341,56937,92169,149860,244274,
%U A365698 398383,649379,1058055,1724575,2814475,4600923,7533150,12347908,20252837,33230545
%N A365698 G.f. satisfies A(x) = 1 + x^5 / (1 - x*A(x)).
%F A365698 G.f.: A(x) = 2*(1+x^5) / (1+x+sqrt( (1+x)^2 - 4*x*(1+x^5) )).
%F A365698 a(n) = Sum_{k=0..floor(n/5)} binomial(n-4*k-1,n-5*k) * binomial(n-5*k+1,k) / (n-5*k+1).
%o A365698 (PARI) a(n) = sum(k=0, n\5, binomial(n-4*k-1, n-5*k)*binomial(n-5*k+1, k)/(n-5*k+1));
%Y A365698 Cf. A212364, A365699, A365700, A365701, A365702.
%Y A365698 Cf. A001006, A023426, A025246, A357308.
%K A365698 nonn
%O A365698 0,12
%A A365698 _Seiichi Manyama_, Sep 16 2023