OFFSET
1,2
LINKS
Cino Hilliard, Count primes in a range.
Cino Hilliard, Count primes in a range up to 10^18, message 58 in seqfun Yahoo group, providing code for gcc (needs formatting to become compilable), Sep 23, 2007. [Cached copy]
EXAMPLE
For n=2, the 4 primes in the range 100 to 110 are 101,103,107,109. So 4 is the second entry in the sequence.
PROG
(PARI) a(n) = primepi(10^n + 10^(n-1)) - primepi(10^n)
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, Sep 23 2007
EXTENSIONS
a(13)-a(19) from Hugo Pfoertner, Nov 16 2019
a(20)-a(21) from Chai Wah Wu, Nov 29 2019
a(22) from Chai Wah Wu, Nov 30 2019
STATUS
approved
