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 A101442 #25 Dec 08 2024 06:17:44
%S A101442 10007,19980,29953,39926,49899,59872,69845,79818,89791,99764,109737,
%T A101442 119710,129683,139656,149629,159602,169575,179548,189521,199494,
%U A101442 209467,219440,229413,239386,249359,259332,269305,279278,289251,299224,309197,319170,329143,339116
%N A101442 a(n) = 9973*n + 10007.
%C A101442 9973 is the largest four-digit prime and 10007 is the smallest five-digit prime.
%H A101442 Vincenzo Librandi, <a href="/A101442/b101442.txt">Table of n, a(n) for n = 0..10000</a>
%H A101442 Chris Caldwell, <a href="https://t5k.org/lists/small/100000.txt">The first 100,008 primes</a>.
%H A101442 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A101442 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A101442 From _Elmo R. Oliveira_, Dec 07 2024: (Start)
%F A101442 G.f.: (10007 - 34*x)/(1 - x)^2.
%F A101442 E.g.f.: (10007 + 9973*x)*exp(x).
%F A101442 a(n) = 2*a(n-1) - a(n-2) for n > 1. (End)
%e A101442 If n=14, then 9973*14 + 10007 = 149629 (a prime).
%t A101442 9973*Range[0,30]+10007 (* or *) LinearRecurrence[{2,-1},{10007,19980},40] (* _Harvey P. Dale_, Sep 02 2015 *)
%o A101442 (Magma) [9973*n + 10007: n in [0..50]]; // _Vincenzo Librandi_, Jul 14 2011
%o A101442 (PARI) a(n)=9973*n+10007 \\ _Charles R Greathouse IV_, Oct 16 2015
%Y A101442 Cf. A017029, A100775, A100776, A101444.
%K A101442 nonn,easy,less
%O A101442 0,1
%A A101442 _Parthasarathy Nambi_, Jan 18 2005
%E A101442 Extended by _Ray Chandler_, Jan 25 2005