|
|
PROG
|
(PARI) l(n)=ln=0; while(n, n=floor(n/10); ln++); return(ln); a=0; for(n=1, 10^6, x=l(prime(n)); if(isprime(x), b=x; if(b>a, a=b; print(n))))
(Python)
from sympy import prime, nextprime, primepi
def a(n): return primepi(nextprime(10**(prime(n)-1)))
print([a(n) for n in range(1, 6)]) # Michael S. Branicky, May 26 2021
|
