OFFSET
1,1
COMMENTS
Before the 20th century, this sequence would have contained the numbers 1,2,3,5,7; see A008578.
There are a total of 8527 terms for primes with 2, 3, or 5 digits, and a total of 594608 terms if primes with 7 digits are also included. - Harvey P. Dale, Nov 02 2020
LINKS
Jeppe Stig Nielsen, Table of n, a(n) for n = 1..10000
EXAMPLE
10007 is a 5-digit prime and so belongs to the sequence.
MATHEMATICA
Table[Prime[Range[PrimePi[10^(p-1)]+1, PrimePi[10^p]]], {p, Prime[Range[ 3]]}]//Flatten (* Harvey P. Dale, Nov 02 2020 *)
PROG
(PARI) g(n) = forprime(x=11, n, if(isprime(length(Str(x))), print1(x", ")))
(PARI) forprime(p=2, 5, forprime(q=10^(p-1), 10^p, print1(q", "))) \\ Charles R Greathouse IV, Oct 04 2011
(Python)
from itertools import islice
from sympy import isprime, nextprime
def agen(): # generator of terms
d = 2
while True:
yield from (i for i in range(10**(d-1)+1, 10**d, 2) if isprime(i))
d = nextprime(d)
print(list(islice(agen(), 57))) # Michael S. Branicky, Dec 27 2023
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Cino Hilliard, Aug 06 2006
EXTENSIONS
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, May 21 2007
STATUS
approved