cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A290394 First k-Ramanujan prime, where k = 1 + 1/n.

Original entry on oeis.org

2, 11, 11, 29, 29, 37, 37, 53, 127, 127, 127, 127, 127, 149, 149, 149, 211, 223, 223, 223, 307, 307, 331, 331, 331, 331, 331, 331, 331, 541, 541, 541, 541, 541, 541, 541, 541, 541, 541, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1361, 1693
Offset: 1

Views

Author

Jonathan Sondow, Jul 29 2017

Keywords

Comments

For real k > 1, the first k-Ramanujan prime is the smallest integer m with pi(x) - pi(x/k) >= 1 for all real x >= m. For 0 < c < 1, the first c-Ramanujan prime is the first k-Ramanujan prime with k = 1/c.
Axler (2015, Cor. 2.4 and Prop. 2.5(ii)) and Axler and Leßmann (2017, Theorem 1) computed the first k-Ramanujan prime for all k >= 1.000040690557321. With k = 1 + 1/n, this gives 1 <= n <= 24575; in particular, a(24575) = 2898359. They also give the isolated result a(28313999) = 10726905041 on p. 646.
The Mathematica program below is based on their algorithm but uses only part of their data (compare A277719) and is valid only for 1 <= n <= 1014; in particular, a(1014) = 48731. Their algorithm uses their result that for N > 1 the N-th prime p_N is the first k-Ramanujan prime if and only if p_N > k*p_{N-1} and p_n <= k*p_{n-1} for all n > N.
See A104272 for additional comments, references, links, formulas, examples, programs, and cross-refs.

Examples

			a(1) = first 2-Ramanujan prime = first 1/2-Ramanujan prime = first Ramanujan prime = A104272(1) = 2.
a(3) = first 4/3-Ramanujan prime = first 3/4-Ramanujan prime = A193880(1) = 11.
		

Crossrefs

Programs

  • Mathematica
    A = {3, 5, 7, 10, 12, 16, 31, 35, 47, 48, 63, 67, 100, 218, 264, 298, 328,  368, 430, 463, 591, 651, 739, 758, 782, 843, 891, 929, 1060, 1184, 1230, 1316, 1410, 1832, 2226, 3386, 3645, 3794, 3796, 4523, 4613, 4755, 5009, 5950}; kR1[k_] := If[k >= 5/3, 2, (m = 1;
       While[k >= Prime[A[[m]]]/Prime[A[[m]] - 1] ||
         k < Prime[A[[m + 1]]]/Prime[A[[m + 1]] - 1], m++];
       Prime[A[[m]]])]; Table[kR1[1 + 1/n], {n, 70}]