The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #21 Apr 30 2018 11:29:44
%S 2,6,23,78,5997
%N Numbers n such that 10^(n-1) + pi(n) is the smallest n-digit prime.
%C In the Cramer model, the chance that there are no primes between 10^(n-1) and 10^(n-1) + pi(n) is 1 + o(1). The same heuristic suggests that there are infinitely many terms since the harmonic series diverges. [_Charles R Greathouse IV_, Nov 15 2010]
%C a(6) > 219035. - _Robert Price_, May 29 2015
%o (Python)
%o from sympy import nextprime, primepi
%o A110068_list = [n for n in range(1,100) if nextprime(10**(n-1))-10**(n-1) == primepi(n)] # _Chai Wah Wu_, Apr 29 2018
%Y Cf. A110065.
%K nonn,base,more
%O 1,1
%A _Farideh Firoozbakht_, Jul 13 2005
%E a(5) from _Charles R Greathouse IV_, Nov 15 2010