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 A376647 #12 Oct 01 2024 07:18:03
%S A376647 1,0,0,1,0,0,1,1,0,1,1,0,1,2,1,1,2,1,1,3,3,2,3,3,2,4,6,5,5,6,5,6,10,
%T A376647 11,10,11,11,11,16,21,21,21,22,22,27,37,42,42,43,44,49,64,79,84,85,87,
%U A376647 93,113,143,163,169,172,180,206,256,306,332,341,352,386,462,562
%N A376647 a(n) = Sum_{k=0..floor(n/3)} binomial(floor(k/2),n-3*k).
%H A376647 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,1,1).
%F A376647 G.f.: (1-x^6)/((1-x^3) * (1-x^6-x^7)) = (1+x^3)/(1-x^6-x^7).
%F A376647 a(n) = a(n-6) + a(n-7).
%F A376647 a(n) = A017847(n) + A017847(n-3).
%o A376647 (PARI) a(n) = sum(k=0, n\3, binomial(k\2, n-3*k));
%o A376647 (PARI) my(N=80, x='x+O('x^N)); Vec((1+x^3)/(1-x^6-x^7))
%Y A376647 Cf. A124789, A134816, A376648.
%Y A376647 Cf. A017847.
%K A376647 nonn,easy
%O A376647 0,14
%A A376647 _Seiichi Manyama_, Oct 01 2024