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 A298037 #24 Jul 20 2024 14:37:25
%S A298037 1,13,25,61,85,145,181,265,313,421,481,613,685,841,925,1105,1201,1405,
%T A298037 1513,1741,1861,2113,2245,2521,2665,2965,3121,3445,3613,3961,4141,
%U A298037 4513,4705,5101,5305,5725,5941,6385,6613,7081,7321,7813,8065,8581,8845,9385,9661
%N A298037 Partial sums of A298036.
%H A298037 Hakan Icoz, <a href="/A298037/b298037.txt">Table of n, a(n) for n = 0..20000</a>
%H A298037 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).
%F A298037 From _Joerg Arndt_, Aug 23 2020: (Start)
%F A298037 G.f.: (1 + 12*x + 10*x^2 + 12*x^3 + x^4)/((1 - x^2)^2*(1-x)).
%F A298037 a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5). (End)
%F A298037 a(n)= A298036(n) + a(n-1). - _Hakan Icoz_, Aug 23 2020
%e A298037 a(1) = 12 + 1 = 13
%e A298037 a(2) = 12 + 13 = 25
%e A298037 a(3) = 36 + 25 = 61
%t A298037 LinearRecurrence[{1, 2, -2, -1, 1}, {1, 13, 25, 61, 85}, 100] (* _Paolo Xausa_, Jul 20 2024 *)
%Y A298037 Cf. A298036.
%K A298037 nonn,easy
%O A298037 0,2
%A A298037 _N. J. A. Sloane_, Jan 22 2018
%E A298037 a(7)-a(50) from _Hakan Icoz_, Aug 22 2020