Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A104272

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Ramanujan primes R_n: a(n) is the smallest number such that if x >= a(n), then pi(x) - pi(x/2) >= n, where pi(x) is the number of primes <= x.
(history; published version)
#346 by Michael De Vlieger at Sun Sep 01 17:12:21 EDT 2024
STATUS

reviewed

approved

#345 by Andrew Howroyd at Sun Sep 01 17:11:08 EDT 2024
STATUS

proposed

reviewed

#344 by Jason Yuen at Sun Sep 01 16:52:59 EDT 2024
STATUS

editing

proposed

#343 by Jason Yuen at Sun Sep 01 16:52:55 EDT 2024
CROSSREFS

Cf. A162996 (Round(kn * (log(kn)+1)), with k = 2.216 as an approximation of R_n = n-th Ramanujan Prime).

STATUS

approved

editing

#342 by Alois P. Heinz at Fri May 03 16:44:49 EDT 2024
STATUS

proposed

approved

#341 by Jon E. Schoenfield at Fri May 03 16:29:01 EDT 2024
STATUS

editing

proposed

#340 by Jon E. Schoenfield at Fri May 03 16:28:49 EDT 2024
COMMENTS

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

LINKS

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>.

STATUS

approved

editing

#339 by Peter Luschny at Fri Feb 24 02:37:30 EST 2023
STATUS

reviewed

approved

#338 by Joerg Arndt at Fri Feb 24 02:36:25 EST 2023
STATUS

proposed

reviewed

#337 by Sidney Cadot at Fri Feb 24 02:28:56 EST 2023
STATUS

editing

proposed