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 A008601 #49 Apr 10 2025 14:08:49 %S A008601 0,19,38,57,76,95,114,133,152,171,190,209,228,247,266,285,304,323,342, %T A008601 361,380,399,418,437,456,475,494,513,532,551,570,589,608,627,646,665, %U A008601 684,703,722,741,760,779,798,817,836,855,874,893,912,931,950,969,988 %N A008601 Multiples of 19. %H A008601 Ivan Panchenko, <a href="/A008601/b008601.txt">Table of n, a(n) for n = 0..200</a> %H A008601 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A008601 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=331">Encyclopedia of Combinatorial Structures 331</a>. %H A008601 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 A008601 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A008601 (floor(a(n)/10) + 2*(a(n) mod 10)) == 0 modulo 19, see A076312. - _Reinhard Zumkeller_, Oct 06 2002 %F A008601 From _Vincenzo Librandi_, Dec 24 2010: (Start) %F A008601 a(n) = 19*n. %F A008601 a(n) = 2*a(n-1) - a(n-2). %F A008601 G.f.: 19*x/(x-1)^2. (End) %F A008601 From _Elmo R. Oliveira_, Apr 10 2025: (Start) %F A008601 E.g.f.: 19*x*exp(x). %F A008601 a(n) = (A008600(n) + A008602(n))/2. (End) %t A008601 Range[0, 1500, 19] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *) %o A008601 (PARI) a(n)=19*n; \\ _Michel Marcus_, Dec 27 2014 %Y A008601 Cf. A008599, A008600, A008602. %K A008601 nonn,easy %O A008601 0,2 %A A008601 _N. J. A. Sloane_