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 A008607 #50 Oct 18 2024 18:08:30 %S A008607 0,25,50,75,100,125,150,175,200,225,250,275,300,325,350,375,400,425, %T A008607 450,475,500,525,550,575,600,625,650,675,700,725,750,775,800,825,850, %U A008607 875,900,925,950,975,1000,1025,1050,1075,1100,1125,1150,1175,1200,1225 %N A008607 Multiples of 25. %H A008607 Vincenzo Librandi, <a href="/A008607/b008607.txt">Table of n, a(n) for n = 0..10000</a> %H A008607 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A008607 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=337">Encyclopedia of Combinatorial Structures 337</a> %H A008607 Luis Manuel Rivera, <a href="http://arxiv.org/abs/1406.3081">Integer sequences and k-commuting permutations</a>, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015. %H A008607 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A008607 G.f.: 25*x/(1-x)^2. - _Colin Barker_, Feb 19 2012 %F A008607 From _Wesley Ivan Hurt_, May 19 2024: (Start) %F A008607 a(n) = 25*n. %F A008607 a(n) = 2*a(n-1) - a(n-2). (End) %F A008607 E.g.f.: 25*x*exp(x). - _Stefano Spezia_, Oct 18 2024 %t A008607 Range[0, 1500, 25] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *) %t A008607 25*Range[0,50] (* _Harvey P. Dale_, Jul 28 2020 *) %o A008607 (PARI) a(n)=25*n \\ _Charles R Greathouse IV_, Oct 07 2015 %Y A008607 Cf. A008605, A008606. %K A008607 nonn,easy %O A008607 0,2 %A A008607 _N. J. A. Sloane_