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 A373639 #21 Sep 29 2024 19:39:01
%S A373639 1,1,1,2,4,6,9,16,27,43,71,119,196,322,533,882,1455,2402,3970,6558,
%T A373639 10829,17887,29548,48804,80608,133146,219925,363254,599998,991044,
%U A373639 1636944,2703794,4465957,7376591,12184181,20125051,33241289,54905857,90690002,149795989
%N A373639 a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-5*k,k).
%H A373639 Harvey P. Dale, <a href="/A373639/b373639.txt">Table of n, a(n) for n = 0..1000</a>
%H A373639 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,2,0,0,-1).
%F A373639 G.f.: 1 / (1 - x^3 - x/(1 - x^3)).
%F A373639 a(n) = a(n-1) + 2*a(n-3) - a(n-6) for n > 5.
%t A373639 LinearRecurrence[{1,0,2,0,0,-1},{1, 1, 1, 2, 4, 6},40] (* _James C. McMahon_, Jun 14 2024 *)
%t A373639 Table[Sum[Binomial[2n-5k,k],{k,0,Floor[n/3]}],{n,0,40}] (* _Harvey P. Dale_, Sep 29 2024 *)
%o A373639 (PARI) a(n) = sum(k=0, n\3, binomial(2*n-5*k, k));
%Y A373639 Cf. A000930, A373640.
%Y A373639 Cf. A052535, A122367, A373644.
%K A373639 nonn,easy
%O A373639 0,4
%A A373639 _Seiichi Manyama_, Jun 12 2024