3779851091

Appears in sequences

• a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function.at n=20A038607
• Smallest prime p such that p/pi(p)>=n.at n=20A038623
• Smallest prime prime(m) such that floor(prime(m)/m) = n.at n=20A062743
• Primes p such that p = 2 (mod pi(p)), where pi(p) = A000720(p) is the prime counting function.at n=10A156152
• a(n) is the smallest x > 2 to satisfy pi(x-1)/(x-1)^n < pi(x)/x^n, where pi(x) is the prime counting function (A000720).at n=20A293010