login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101442 a(n) = 9973*n + 10007. 4

%I #18 Apr 03 2023 10:36:10

%S 10007,19980,29953,39926,49899,59872,69845,79818,89791,99764,109737,

%T 119710,129683,139656,149629,159602,169575,179548,189521,199494,

%U 209467,219440,229413,239386,249359,259332,269305,279278,289251,299224,309197

%N a(n) = 9973*n + 10007.

%C 9973 is the largest four-digit prime and 10007 is the smallest five-digit prime.

%H Vincenzo Librandi, <a href="/A101442/b101442.txt">Table of n, a(n) for n = 0..10000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H Chris Caldwell, <a href="https://t5k.org/lists/small/100000.txt">The first 100,008 primes</a>.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%e If n=14, then 9973*14 + 10007 = 149629 (a prime).

%t 9973*Range[0,30]+10007 (* or *) LinearRecurrence[{2,-1},{10007,19980},40] (* _Harvey P. Dale_, Sep 02 2015 *)

%o (Magma) [9973*n + 10007: n in [0..50]]; // _Vincenzo Librandi_, Jul 14 2011

%o (PARI) a(n)=9973*n+10007 \\ _Charles R Greathouse IV_, Oct 16 2015

%Y Cf. A017029, A100775, A100776, A101444.

%K nonn,easy

%O 0,1

%A _Parthasarathy Nambi_, Jan 18 2005

%E Extended by _Ray Chandler_, Jan 25 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:06 EDT 2024. Contains 371918 sequences. (Running on oeis4.)