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 A301717 #13 Sep 07 2024 17:00:31
%S A301717 1,7,19,37,55,85,121,157,205,253,307,373,439,511,589,673,763,859,961,
%T A301717 1063,1177,1297,1417,1549,1681,1819,1969,2119,2275,2437,2605,2779,
%U A301717 2959,3145,3331,3529,3733,3937,4153,4369,4591,4825,5059,5299,5545,5797,6055,6319,6589,6859,7141,7429,7717,8017,8317,8623
%N A301717 Partial sums of A301716.
%C A301717 Linear recurrence and g.f. confirmed by Shutov/Maleev link in A301716. - _Ray Chandler_, Aug 30 2023
%H A301717 Ray Chandler, <a href="/A301717/b301717.txt">Table of n, a(n) for n = 0..1000</a>
%H A301717 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 1, -1, 1, -1, 0, -1, 1).
%F A301717 From _Colin Barker_, Apr 09 2018: (Start)
%F A301717 G.f.: (1 + 6*x + 12*x^2 + 17*x^3 + 12*x^4 + 17*x^5 + 12*x^6 + 6*x^7 + x^8) / ((1 - x)^3*(1 + x + x^2)*(1 + x + x^2 + x^3 + x^4)).
%F A301717 a(n) = a(n-1) + a(n-3) - a(n-4) + a(n-5) - a(n-6) - a(n-8) + a(n-9) for n>8.
%F A301717 (End)
%t A301717 Accumulate[LinearRecurrence[{0,0,1,0,1,0,0,-1},{1,6,12,18,18,30,36,36,48},60]] (* or *) LinearRecurrence[{1,0,1,-1,1,-1,0,-1,1},{1,7,19,37,55,85,121,157,205},60] (* _Harvey P. Dale_, Sep 07 2024 *)
%Y A301717 Cf. A301716.
%K A301717 nonn
%O A301717 0,2
%A A301717 _N. J. A. Sloane_, Mar 26 2018