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 A008605 #47 Apr 10 2025 16:05:29
%S A008605 0,23,46,69,92,115,138,161,184,207,230,253,276,299,322,345,368,391,
%T A008605 414,437,460,483,506,529,552,575,598,621,644,667,690,713,736,759,782,
%U A008605 805,828,851,874,897,920,943,966,989,1012,1035,1058,1081,1104,1127,1150
%N A008605 Multiples of 23.
%H A008605 Vincenzo Librandi, <a href="/A008605/b008605.txt">Table of n, a(n) for n = 0..1000</a>
%H A008605 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A008605 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=335">Encyclopedia of Combinatorial Structures 335</a>.
%H A008605 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 A008605 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A008605 G.f.: 23*x/(x-1)^2. - _Vincenzo Librandi_, Jun 10 2013
%F A008605 E.g.f.: 23*x*exp(x). - _Stefano Spezia_, Mar 02 2025
%F A008605 From _Elmo R. Oliveira_, Apr 10 2025: (Start)
%F A008605 a(n) = 23*n = (A008604(n) + A008606(n))/2.
%F A008605 a(n) = 2*a(n-1) - a(n-2). (End)
%t A008605 Range[0, 1500, 23] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *)
%t A008605 CoefficientList[Series[23 x / (x - 1)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jun 10 2013 *)
%o A008605 (PARI) a(n)=23*n \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A008605 Cf. A008602, A008603, A008604, A008606.
%K A008605 nonn,easy
%O A008605 0,2
%A A008605 _N. J. A. Sloane_