A225907 Smallest n-Ramanujan prime that is less than half of the next n-Ramanujan prime, or 0 if none exists.
0, 2, 11, 41, 587, 14143
Offset: 0
Examples
By Bertrand's Postulate (proved by Chebyshev), prime(k+1) < 2*prime(k) for all k, so a(0) = 0. Ramanujan proved that the Ramanujan primes begin 2, 11, ..., so a(1) = 2. Paksoy proved that the 2-Ramanujan primes begin 11, 41,..., so a(2) = 11. It appears that the 3-Ramanujan primes begin 41, 149, ...; if true, then a(3) = 41. It appears that the 4-Ramanujan primes begin 569, 571, 587, 1367 ...; if true, then a(4) = 587.
Links
- Murat Baris Paksoy, Derived Ramanujan primes: R'_n, arXiv:1210.6991 [math.NT], 2012.
Comments