reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Cf. A162996 (Round(kn * (log(kn)+1)), with k = 2.216 as an approximation of R_n = n-th Ramanujan Prime).
approved
editing
proposed
approved
editing
proposed
A good approximation to a(n) = R_n for n in [1..1000] is A162996(n) = Roundround(k*n * (log(k*n)+1)), with k = 2.216 determined empirically from the first 1000 Ramanujan primes, which approximates the {k*n}-th prime number which in turn approximates the n-th Ramanujan prime and where Absabs(A162996(n) - R_n) < 2 * Sqrtsqrt(A162996(n)) for n in [1..1000]. Since R_n ~ prime(2n) ~ 2n * (log(2n)+1) ~ 2n * log(2n), while A162996(n) ~ prime(k*n) ~ k*n * (log(k*n)+1) ~ k*n * log(k*n), A162996(n) / R_n ~ k/2 = 2.216/2 = 1.108 which implies an asymptotic overestimate of about 10% (a better approximation would need k to depend on n and be asymptotic to 2.) . - Daniel Forgues, Jul 29 2009
Let p_n be the n-th prime. If p_n >= 3 is in the sequence, then all integers (p_n+1)/2, (p_n+3)/2, ..., (p_(n+1)-1)/2 are composite numbers. - Vladimir Shevelev, Aug 12 2009
N. Amersi, O. Beckwith, S. J. Miller, R. Ronan, J. Sondow, <a href="https://doi.org/10.1007/978-1-4939-1601-6_1">Generalized Ramanujan primes</a>, Combinatorial and Additive Number Theory, Springer Proc. in Math. & Stat., CANT 2011 and 2012, Vol. 101 (2014), 1-13.
Jonathan Sondow, <a href="http://www.jstor.org/stable/40391170">Ramanujan primes and Bertrand's postulate</a>, Amer. Math. Monthly, 116 (2009), 630-635. <a href="https://zbmath.org/?q=an:1229.11013">Zentralblatt review</a>.
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed