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 A053741 #30 Jul 02 2025 16:01:59 %S A053741 20,70,120,170,220,270,320,370,420,470,520,570,620,670,720,770,820, %T A053741 870,920,970,1020,1070,1120,1170,1220,1270,1320,1370,1420,1470,1520, %U A053741 1570,1620,1670,1720,1770,1820,1870,1920,1970,2020,2070,2120,2170,2220,2270 %N A053741 Sum of even numbers in range 10*n to 10*n+9. %H A053741 Vincenzo Librandi, <a href="/A053741/b053741.txt">Table of n, a(n) for n = 0..10000</a> %H A053741 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A053741 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A053741 a(n) = 50*n + 20. %F A053741 From _Colin Barker_, Jun 27 2012: (Start) %F A053741 a(n) = 2*a(n-1) - a(n-2). %F A053741 G.f.: 10*(2+3*x)/(1-x)^2. (End) %F A053741 E.g.f.: 10*(2+5*x)*exp(x). - _G. C. Greubel_, Sep 06 2019 %e A053741 20 is sum of 0, 2, 4, 6, 8; %e A053741 70 is sum of 10, 12, 14, 16, 18; %e A053741 120 is sum of 20, 22, 24, 26, 28; etc. %p A053741 seq(10*(2+5*n), n=0..50); # _G. C. Greubel_, Sep 06 2019 %t A053741 50Range[50]-30 (* _Harvey P. Dale_, Mar 06 2011 *) %o A053741 (Magma) [20+50*n: n in [0..50]]; // _Vincenzo Librandi_, Aug 12 2011 %o A053741 (PARI) vector(50, n, 10*(5*n-3)) \\ _G. C. Greubel_, Sep 06 2019 %o A053741 (Sage) [10*(2+5*n) for n in (0..50)] # _G. C. Greubel_, Sep 06 2019 %o A053741 (GAP) List([0..50], n-> 10*(2+5*n)); # _G. C. Greubel_, Sep 06 2019 %Y A053741 Cf. A053742, A053743. %K A053741 nonn,easy %O A053741 0,1 %A A053741 _Odimar Fabeny_, Feb 13 2000 %E A053741 More terms from _James Sellers_, Feb 22 2000