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 A301698 #18 Jul 31 2024 11:17:11
%S A301698 1,6,16,32,54,81,113,150,192,240,294,353,417,486,560,640,726,817,913,
%T A301698 1014,1120,1232,1350,1473,1601,1734,1872,2016,2166,2321,2481,2646,
%U A301698 2816,2992,3174,3361,3553,3750,3952,4160,4374,4593,4817,5046,5280,5520,5766,6017,6273,6534,6800,7072,7350,7633,7921,8214,8512,8816,9126,9441,9761
%N A301698 Partial sums of A301697.
%C A301698 Linear recurrence and g.f. confirmed by Shutov/Maleev link in A301697. - _Ray Chandler_, Aug 30 2023
%H A301698 Ray Chandler, <a href="/A301698/b301698.txt">Table of n, a(n) for n = 0..1000</a>
%H A301698 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,-4,4,-4,4,-3,1).
%F A301698 From _Colin Barker_, Apr 08 2018: (Start)
%F A301698 G.f.: (1 + 3*x + 2*x^2 + 4*x^3 + 2*x^4 + 3*x^5 + x^6) / ((1 - x)^3*(1 - x + x^2)*(1 + x + x^2)).
%F A301698 a(n) = 3*a(n-1) - 4*a(n-2) + 4*a(n-3) - 4*a(n-4) + 4*a(n-5) - 3*a(n-6) + a(n-7) for n>6. (End)
%t A301698 LinearRecurrence[{3, -4, 4, -4, 4, -3, 1}, {1, 6, 16, 32, 54, 81, 113}, 100] (* _Paolo Xausa_, Jul 31 2024 *)
%Y A301698 Cf. A301697.
%K A301698 nonn
%O A301698 0,2
%A A301698 _N. J. A. Sloane_, Mar 26 2018