A164368 -id:A164368 - cp's OEIS frontend

A164554 Ramanujan primes A104272(n) for which A104272(n) = A080359(n).

2, 71, 101, 181, 239, 241, 269, 349, 373, 409, 419, 433, 439, 491, 593, 599, 601, 607, 647, 653, 659, 823, 827, 857, 947, 1021, 1031, 1061, 1063, 1091, 1103, 1301, 1427, 1429, 1447, 1451, 1489, 1553, 1559, 1567, 1601, 1607, 1609, 1789, 1867, 1871, 1913, 1999, 2003

Offset: 1

Vladimir Shevelev, Aug 15 2009

nonn

For every n>=1, A104272(n) >= A080359(n), and the sequence shows where the inequality becomes an equality.

Let prime(m) < a(n)/2 < prime(m+1); then there exist primes p

For example, a(2) = 71, 31 < a(2)/2 < 37 and intervals (62,71), (71,74) contain the primes p = 67 and q = 73 respectively.

Let us call a prime p compatible with another prime q, if the intervals (p/2,q/2) and (p,q], if q>p, (or intervals (q/2,p/2) and (q,p], if qVladimir Shevelev, Apr 25 2012]

			a(2)=71, such that 31<71/2<37, and we see that p=67 is in interval (62, 71) and q=73 is in interval (71, 74).

V. Shevelev, On critical small intervals containing primes, arXiv:0908.2319 [math.NT] [From _Vladimir Shevelev_, Aug 20 2009]
V. Shevelev, Ramanujan and Labos primes, their generalizations, and classifications of primes, J. Integer Seq. 15 (2012) Article 12.5.4
J. Sondow, J. W. Nicholson, and T. D. Noe, Ramanujan Primes: Bounds, Runs, Twins, and Gaps, J. Integer Seq. 14 (2011) Article 11.6.2

Cf. A104272, A080359, A164368, A164333, A164288, A164294, A212493, A212541.

nn = 200; t = Table[0, {nn+1}]; s = 0;
Do[If[PrimeQ[k], s++]; If[PrimeQ[k/2], s--]; If[s <= nn && t[[s+1]] == 0, t[[s+1]] = k], {k, Prime[3nn]}
];
A080359 = Rest[t];
R = Table[0, {nn}]; s = 0;
Do[If[PrimeQ[k], s++]; If[PrimeQ[k/2], s--]; If[s < nn, R[[s+1]] = k], {k, Prime[3nn]}
];
A104272 = R+1;
Intersection[A104272, A080359] (* Jean-François Alcover, Oct 28 2018, after T. D. Noe in A104272 *)

All solutions of the equation A104272(x)=A080359(x) are x=pi(a(n))-pi(a(n)/2). - Vladimir Shevelev, Apr 25 2012

Terms beyond 659 from R. J. Mathar, Dec 17 2009

A195325 Least n-gap prime: a(n) = least prime p for which there is no prime between np and nq, where q is the next prime after p.

Original entry on oeis.org

2, 59, 71, 29, 59, 149, 191, 641, 149, 347, 809, 461, 3371, 1487, 857, 1301, 1877, 5849, 4721, 9239, 4271, 1619, 1481, 20507, 20981, 32117, 13337, 19379, 24977, 48779, 20441, 25301, 5651, 37991, 17747, 43577, 176777, 145757, 191249, 84809, 150209, 11717

Offset: 1

Vladimir Shevelev, Sep 15 2011

nonn

Such a prime always exists.
The sequence is unbounded.
Conjecture. For n >= 2, a(n) is a lesser of twin primes (A001359). This implies the twin prime conjecture. - Vladimir Shevelev, Sep 15 2011
If a member of this sequence is not the lesser of a twin prime pair, it is greater than 10^10. - Charles R Greathouse IV, Sep 15 2011
A dual sequence: b(n)= least prime p for which there is no prime between n*q and n*p, where q is the previous prime before p. Evidently, b(n) is the next prime after a(n): 3,61,73,31,..., and for n>=2, by the same conjecture, b(n) is a greater of twin primes.

Charles R Greathouse IV, Table of n, a(n) for n = 1..169, (first 100 terms from Alois P. Heinz)
Index entries for primes, gaps between

Cf. A080192, A195270, A195271, A164368, A194658, A164294, A110835, A195465.

a:= proc(n) local p, q;
      p:= 2; q:= nextprime(p);
      while nextprime(n*p) < (n*q) do
        p, q:= q, nextprime(q)
      od; p
    end:
seq (a(n), n=1..25); # Alois P. Heinz, Sep 15 2011

pQ[p_, r_] := Block[{q = NextPrime[p]},NextPrime[r*p]> r*q]; f[n_] := Block[{p = 2}, While[ !pQ[p, n], p = NextPrime[p]]; p]; f[1] = 2; Array[f, 42] (* Robert G. Wilson v, Sep 18 2011 *) (* Revised by Zak Seidov, Sep 19 2011 *)

A163961 First differences of A116533.

Original entry on oeis.org

1, 2, -1, 3, -1, 5, -1, -1, -1, 7, -1, 13, -1, -1, -1, 23, -1, -1, -1, 43, -1, -1, -1, 83, -1, -1, -1, 163, -1, -1, -1, -1, -1, -1, -1, -1, -1, 317, -1, -1, -1, 631, -1, -1, -1, 1259, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 2503, -1, -1, -1, 5003, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1

Offset: 1

Vladimir Shevelev, Aug 07 2009, Aug 14 2009

sign

Ignoring the +-1 terms, we obtain the sequence of Bertrand's primes A006992. If we consider sequences A_i={a_i(n)}, i=1,2,... with the same constructions as A116533, but with initials a_1(1)=2, a_2(1)=11, a_3(1)=17,..., a_m(1)=A164368(m),..., then the union of A_1,A_2,... contains all primes.

Cf. A116533, A006992, A055496, A080359, A104272, A106108, A132199, A164368

A116533 := proc(n) option remember; if n <=2 then n; else if isprime(procname(n-1)) then 2*procname(n-1) ; else procname(n-1)-1 ; end if; end if; end proc:
A163961 := proc(n) A116533(n+1)-A116533(n) ; end proc: # R. J. Mathar, Sep 03 2011

Differences@ Prepend[NestList[If[PrimeQ@ #, 2 #, # - 1] &, 2, 90], 1] (* Michael De Vlieger, Dec 06 2018 *)

a116533(n) = if(n==1, 1, if(n==2, 2, if(ispseudoprime(a116533(n-1)), 2*a116533(n-1), a116533(n-1)-1)))
a(n) = a116533(n+1)-a116533(n) \\ Felix Fröhlich, Dec 06 2018

lista(nn) = {va = vector(nn); va[1] = 1; va[2] = 2; for (n=3, nn, va[n] = if (isprime(va[n-1]), 2*va[n-1], va[n-1]-1);); vector(nn-1, n, va[n+1] - va[n]);} \\ Michel Marcus, Dec 07 2018

A194658 a(n) is the maximal prime, such that for all primes x<=a(n) the number of primes in (x/2,x) is less than n.

Original entry on oeis.org

2, 11, 17, 29, 41, 47, 59, 67, 71, 97, 101, 107, 109, 137, 151, 167, 179, 181, 191, 197, 233, 239, 241, 263, 269, 281, 283, 311, 347, 349, 367, 373, 401, 409, 419, 431, 433, 439, 461, 487, 491, 503, 521, 571, 587, 593, 599, 601, 607, 617, 643, 647, 653

Offset: 1

Vladimir Shevelev, Sep 01 2011

nonn

The next prime after a(n) is A080359(n+1).

Alois P. Heinz, Table of n, a(n) for n = 1..1000
V. Shevelev, Ramanujan and Labos primes, their generalizations and classifications of primes, arXiv:0909.0715 [math.NT], 2009-2011.
J. Sondow, J. W. Nicholson, and T. D. Noe, Ramanujan Primes: Bounds, Runs, Twins, and Gaps, arXiv:1105.2249 [math.NT], 2011; J. Integer Seq. 14 (2011) Article 11.6.2.

Subsequence of A164368.

Cf. A080359, A193507, A104272.

b[1] = 2; b[n_] := b[n] = Module[{x = b[n-1]}, While[PrimePi[x] - PrimePi[ Quotient[x, 2]] != n, x++]; x];
a[n_] := NextPrime[b[n+1], -1];
Array[a, 100] (* Jean-François Alcover, Nov 11 2018 *)

A080359(n) <= a(n) <= A104272(n).

A195270 3-gap primes: Prime p is a term iff there is no prime between 3p and 3q, where q is the next prime after p.

Original entry on oeis.org

71, 107, 137, 281, 347, 379, 443, 461, 557, 617, 641, 727, 809, 827, 853, 857, 991, 1031, 1049, 1091, 1093, 1289, 1297, 1319, 1433, 1489, 1579, 1607, 1613, 1697, 1747, 1787, 1867, 1871, 1877, 1931, 1987, 1997, 2027, 2237, 2269, 2309, 2377, 2381, 2473, 2591

Offset: 1

Vladimir Shevelev, Sep 14 2011

nonn

For a real r>1, a prime p is called an r-gap prime, if there is no prime between r*p and r*q, where q is the next prime after p. In particular, 2-gap primes are in A080192.

In many cases, q=p+2. E.g., among first 1000 terms there are 509 such cases. - Zak Seidov, Jun 29 2015

Zak Seidov, Table of n, a(n) for n = 1..10000

Cf. A080192, A193507, A194186, A164368, A194598, A194658, A194659, A194674, A164288, A164294.

filter:= p -> isprime(p) and nextprime(3*p)>3*nextprime(p):
select(filter, [2,seq(2*i+1,i=1..2000)]); # Robert Israel, Jun 29 2015

pQ[p_, r_] := Block[{q = NextPrime@ p}, Union@ PrimeQ@ Range[r*p, r*q] == {False}]; Select[ Prime@ Range@ 380, pQ[#, 3] &] (* Robert G. Wilson v, Sep 18 2011 *)
k = 3; p = 71; Reap[Do[While[NextPrime[k*p] < k*(q = NextPrime[p]), p = q]; Sow[p]; p = q, {1000}]][[2, 1]] (* for first 1000 terms. - Zak Seidov, Jun 29 2015 *)
Prime/@SequencePosition[PrimePi[3*Prime[Range[400]]],{x_,x_}][[;;,1]] (* Harvey P. Dale, Nov 29 2023 *)

A166252 Primes which are not the smallest or largest prime in an interval of the form (2prime(k),2prime(k+1)).

Original entry on oeis.org

71, 101, 109, 151, 181, 191, 229, 233, 239, 241, 269, 283, 311, 349, 373, 409, 419, 433, 439, 491, 571, 593, 599, 601, 607, 643, 647, 653, 659, 683, 727, 823, 827, 857, 941, 947, 991, 1021, 1031, 1033, 1051, 1061, 1063, 1091, 1103, 1301, 1373, 1427, 1429

Offset: 1

Vladimir Shevelev, Oct 10 2009, Oct 14 2009

nonn

Called "central primes" in A166251, not to be confused with the central polygonal primes A055469.
The primes tabulated in intervals (2*prime(k),2*prime(k+1)) are
5, k=1
7, k=2
11,13, k=3
17,19, k=4
23,    k=5
29,31, k=6
37,    k=7
41,43, k=8
47,53, k=9
59,61, k=10
67,71,73,  k=11
79,        k=12
83,     k=13
89,     k=14
97,101,103, k=15
and only rows with at least 3 primes contribute primes to the current sequence.
For n >= 2, these are numbers of A164368 which are in A194598. - Vladimir Shevelev, Apr 27 2012

			Since 2*31 < 71 < 2*37 and the interval (62, 74) contains prime 67 < 71 and prime 73 > 71, then 71 is in the sequence.

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A166307, A182365, A166251, A164368, A104272, A080359, A164333, A164288, A164294, A164554, A194598.

n = 0; t = {}; While[Length[t] < 100, n++; ps = Select[Range[2*Prime[n], 2*Prime[n+1]], PrimeQ]; If[Length[ps] > 2, t = Join[t, Rest[Most[ps]]]]]; t (* T. D. Noe, Apr 30 2012 *)

A166307 The smallest prime in some interval of the form (2prime(k),2prime(k+1)) if this interval contains at least 2 primes.

Original entry on oeis.org

11, 17, 29, 41, 47, 59, 67, 97, 107, 127, 137, 149, 167, 179, 197, 227, 263, 281, 307, 347, 367, 401, 431, 461, 487, 503, 521, 569, 587, 617, 641, 677, 719, 739, 751, 769, 809, 821, 853, 881, 907, 937, 967, 983, 1009, 1019, 1049, 1087, 1097, 1117, 1151, 1163, 1187, 1217, 1229, 1249, 1277

Offset: 1

Vladimir Shevelev, Oct 11 2009, Oct 17 2009

nonn

These are called "right primes" in A166251.

			For p=29 we have: 2*13 < 29 < 2*17 and interval (26, 29) is free from primes while interval (29, 34) contains a prime. Therefore 29 is in the sequence for k=6.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A166252, A166251, A164368, A104272, A080359, A164333, A164288, A164294, A164554, A182365.

f[n_] := Block[{t = Select[ Table[i, {i, 2 Prime[n], 2 Prime[n + 1]}], PrimeQ]}, If[ Length@ t > 1, t[[1]], 0]]; Rest@ Union@ Array[f, 115] (* Robert G. Wilson v, May 08 2011 *)

A164952 Primes p with the property: if p/3 is in the interval (p_m, p_(m+1)), where p_m>=3 and p_k is the k-th prime, then the interval (p, 3p_(m+1)) contains a prime.

Original entry on oeis.org

2, 3, 11, 17, 23, 29, 41, 43, 59, 61, 71, 73, 79, 97, 101, 103, 107, 131, 137, 149, 151, 163, 167, 179, 191, 193, 223, 227, 229, 239, 251, 257, 269, 271, 277, 281, 311, 331, 347, 349, 353, 359, 367, 373, 383, 397, 419, 421, 431, 433, 439, 457, 461, 463, 479, 491

Offset: 1

Vladimir Shevelev, Sep 01 2009

nonn

For k>1 (not necessarily integer), we call a Ramanujan k-prime R_n^(k) the prime a_k(n) which is the smallest number such that if x >= a_k(n), then pi(x)- pi(x/k) >= n. Note that, the sequence of all primes corresponds to the case of "k=oo". These numbers possess the following properties: R_n^(k)~p_((k/(k-1))n) as n tends to the infinity; if A_k(x) is the counting function of the Ramanujan k-primes not exceeding x, then A_k(x)~(1-1/k)\pi(x) as x tends to the infinity; let p be a Ramanujan k-prime, such that p/k is in the interval (p_m, p_(m+1)), where p_m>=3 and p_n is the n-th prime. Then the interval (p, k*p_(m+1)) contains a prime. Conjecture. For every k>=2 there exist non-Ramanujan k-primes, which possess the latter property. For example, for k=2, the smallest such prime is 109. Problem. For every k>2 to estimate the smallest non-Ramanujan k-prime which possesses the latter property. [From Vladimir Shevelev, Sep 01 2009]

All Ramanujan 3-primes are in the sequence.

			If p=61, the p/3 is in the interval (19, 23); we see that the interval (61,69) contains a prime (67).

Vladimir Shevelev, Charles R. Greathouse IV, Peter J. C. Moses, On intervals (kn, (k+1)n) containing a prime for all n>1, Journal of Integer Sequences, Vol. 16 (2013), Article 13.7.3. arXiv:1212.2785

Cf. A104272, A164368, A164288.

nn=1000; t=Table[0, {nn}]; s=0; Do[If[PrimeQ[k], s++]; If[PrimeQ[k/3], s--]; If[s

Extended and edited by T. D. Noe, Nov 22 2010

Comments edited by Jonathan Sondow, Aug 27 2011

A195271 1.5-gap primes: Prime p is a term iff there is no prime between 1.5p and 1.5q, where q is the next prime after p.

Original entry on oeis.org

2, 5, 17, 29, 41, 79, 101, 137, 149, 163, 191, 197, 227, 269, 281, 313, 349, 353, 461, 463, 521, 541, 569, 593, 599, 613, 617, 641, 757, 769, 809, 821, 827, 857, 881, 887, 941, 1009, 1049, 1061, 1087, 1093, 1097, 1117, 1151, 1223, 1229, 1277, 1279, 1289

Offset: 1

Vladimir Shevelev, Sep 14 2011

nonn

For a real r>1, a prime p is called an r-gap prime, if there is no prime between r*p and r*q, where q is the next prime after p. In particular, 2-gap primes form A080192 and 3-gap primes form A195270.

Cf. A080192, A195270, A193507, A194186, A164368, A194598, A194658, A194659, A194674, A164288, A164294.

Select[Prime[Range[400]], PrimePi[3*NextPrime[#]/2] == PrimePi[3*#/2] &] (* T. D. Noe, Sep 14 2011 *)

A182365 The largest prime in some interval of the form (2prime(k),2prime(k+1)) if this interval contains at least 2 primes.

Original entry on oeis.org

13, 19, 31, 43, 53, 61, 73, 103, 113, 131, 139, 157, 173, 193, 199, 251, 271, 293, 313, 353, 379, 421, 443, 463, 499, 509, 523, 577, 613, 619, 661, 691, 733, 743, 757, 773, 811, 829, 859, 883, 911, 953, 971, 997, 1013, 1039, 1069, 1093, 1109, 1123, 1153

Offset: 1

Vladimir Shevelev, Apr 26 2012

nonn

These are called "left primes" in A166251.

			For k=6 we have 2*13 < 29 < 31 < 2*17, and the interval contains two primes. Therefore 31 is in the sequence.

Cf. A166252, A166251, A164368, A104272, A080359, A164333, A164288, A164294, A164554, A166307.

n = 0; t = {}; While[Length[t] < 100, n++; ps = Select[Range[2*Prime[n], 2*Prime[n + 1]], PrimeQ]; If[Length[ps] >= 2, AppendTo[t, ps[[-1]]]]]; t (* T. D. Noe, Apr 30 2012 *)

Previous Showing 11-20 of 35 results. Next

cp's OEIS Frontend

A164554 Ramanujan primes A104272(n) for which A104272(n) = A080359(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A195325 Least n-gap prime: a(n) = least prime p for which there is no prime between n*p and n*q, where q is the next prime after p.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

A163961 First differences of A116533.

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

A194658 a(n) is the maximal prime, such that for all primes x<=a(n) the number of primes in (x/2,x) is less than n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A195270 3-gap primes: Prime p is a term iff there is no prime between 3*p and 3*q, where q is the next prime after p.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

A166252 Primes which are not the smallest or largest prime in an interval of the form (2*prime(k),2*prime(k+1)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A166307 The smallest prime in some interval of the form (2*prime(k),2*prime(k+1)) if this interval contains at least 2 primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A164952 Primes p with the property: if p/3 is in the interval (p_m, p_(m+1)), where p_m>=3 and p_k is the k-th prime, then the interval (p, 3p_(m+1)) contains a prime.

Views

Author

Keywords

Comments

Examples

A195325 Least n-gap prime: a(n) = least prime p for which there is no prime between np and nq, where q is the next prime after p.

A195270 3-gap primes: Prime p is a term iff there is no prime between 3p and 3q, where q is the next prime after p.

A166252 Primes which are not the smallest or largest prime in an interval of the form (2prime(k),2prime(k+1)).

A166307 The smallest prime in some interval of the form (2prime(k),2prime(k+1)) if this interval contains at least 2 primes.

A195271 1.5-gap primes: Prime p is a term iff there is no prime between 1.5p and 1.5q, where q is the next prime after p.

A182365 The largest prime in some interval of the form (2prime(k),2prime(k+1)) if this interval contains at least 2 primes.