Ramanujan prime

The $n$th $p$ is the smallest prime such that there are at least $n$ primes between $x$ and $2x$ for any $x$ such that $2x>p$. So, given the prime counting function $\pi (x)$, then for the $n$th Ramanujan prime $p$ it is always the case that $\pi (2x)-\pi (x)\ge n$ when $2x>p$. These primes arise from Srinivasa Ramanujan’s proof of Bertrand’s postulate. The first few are 2, 11, 17, 29, 41, 47, 59, 67, 71, 97, 101, 107, 127, listed in A104272 of Sloane’s OEIS.

For example, the third Ramanujan prime is 17. We can verify that there are three primes between 8.5005 and 17.001 (namely 11, 13, 17), that there are also three primes between 9 and 18 (the same as before), more than three primes between 10 and 20 (namely the prime quadruplet 11, 13, 17. 19), etc. Furthermore, we can verify that no prime smaller than 17 satisfies this condition by finding a single counterexample for the smaller primes, specifically: setting $x=7$ we have $2x=14$, which is greater than 2, 3, 5, 7, 11 and 13, and we verify that there are only two primes between 7 and 14 (namely 11 and 13).