OFFSET
1,1
COMMENTS
Of this sequence, Wells (2005) wrote: "Sloane's On-Line Encyclopedia of Integer Sequences declines to include it, naturally," giving it as an example of "sink[ing] even lower" than the iccanobiF primes. - Alonso del Arte, Mar 07 2012
REFERENCES
David Wells, Prime Numbers: The Most Mysterious Figures in Math. Hoboken, New Jersey: John Wiley & Sons (2005): 228.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
Primes of the form 1000n + 7 with n >= 1.
MAPLE
select(isprime, [1000*i+7$i=1..200])[]; # Alois P. Heinz, Feb 03 2023
MATHEMATICA
Select[Range[1007, 200007, 1000], PrimeQ] (* Alonso del Arte, Mar 07 2012 *)
PROG
(PARI) forstep(n=1007, 1e6, 1000, if(isprime(n), print1(n", "))) \\ Charles R Greathouse IV, Mar 07 2012
(Python)
from sympy import isprime
from itertools import count, islice
def agen(): yield from (t for t in count(1007, 1000) if isprime(t))
print(list(islice(agen(), 33))) # Michael S. Branicky, Feb 03 2023
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Kausthub Gudipati, Jul 30 2011
EXTENSIONS
Corrected and extended by Charles R Greathouse IV, Jul 30 2011
STATUS
approved