A193507 -id:A193507 - cp's OEIS frontend

A194186 a(n) = A193507(n) - A080359(n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 12, 0, 0, 0, 0, 36, 34, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 16, 0, 0, 0, 12, 0, 0, 0, 0, 0

Offset: 1

Vladimir Shevelev, Aug 18 2011

nonn

Conjecture: The sequence is unbounded.
Records are 0, 18, 36, 48, 52, ... with indices 1, 14, 20, 44, 96, ...
The places of nonzero terms correspond to places of those terms of A193507 which are in A164294. Conjecture: The asymptotic density of nonzero terms is 2/(e^2+1). A heuristic proof follows from the comment to A193507 and the first reference there.

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A193507, A080359, A104272, A194184.

A194184 a(n) = A104272(n)-A193507(n).

Original entry on oeis.org

0, 8, 4, 10, 10, 4, 6, 6, 0, 24, 0, 4, 18, 18, 0, 10, 6, 0, 36, 0, 0, 0, 0, 12, 0, 10, 24, 0, 34, 0, 14, 0, 22, 0, 0, 10, 0, 0, 18, 24, 0, 4, 60, 0, 10, 0, 0, 0, 0, 28, 0, 0, 0, 0, 16, 36, 0, 6, 8, 12, 36, 10, 0, 0, 24, 0, 22, 54, 0, 0, 14, 12, 18, 6, 0, 0, 16

Offset: 1

Vladimir Shevelev, Aug 18 2011

nonn

Conjecture: The sequence is unbounded.
Records are 0, 8, 10, 24, 36, 60, 64, ... with indices 1, 2, 4, 10, 19, 43, 95, ...
Conjecture: The lower asymptotic density of nonzero terms is >0.

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A104272, A193507, A194186.

A080359 The smallest integer x > 0 such that the number of primes in (x/2, x] equals n.

Original entry on oeis.org

2, 3, 13, 19, 31, 43, 53, 61, 71, 73, 101, 103, 109, 113, 139, 157, 173, 181, 191, 193, 199, 239, 241, 251, 269, 271, 283, 293, 313, 349, 353, 373, 379, 409, 419, 421, 433, 439, 443, 463, 491, 499, 509, 523, 577, 593, 599, 601, 607, 613, 619, 647, 653, 659

Offset: 1

Labos Elemer, Feb 21 2003

nonn

a(n) is the same as: Smallest integer x > 0 such that the number of unitary-prime-divisors of x! equals n.
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
For n >= 3, denote by q(n) the prime which is the nearest from the left to a(n)/2. Then there exists a prime between 2q(n) and a(n). The converse, generally speaking, is not true; i.e., there exist primes that are outside the sequence, but possess such property (e.g., 131). - Vladimir Shevelev, Aug 14 2009
See sequence A164958 for a generalization. - Vladimir Shevelev, Sep 02 2009
a(n) is the n-th Labos prime.

			n=5: in 31! five unitary-prime-divisors appear (firstly): {17,19,23,29,31}, while other primes {2,3,5,7,11,13} are at least squared. Thus a(5)=31.
Consider a(9)=71. Then the nearest prime < 71/2 is q(9)=31, and between 2q(9) and a(9), i.e., between 62 and 71 there exists a prime (67). - _Vladimir Shevelev_, Aug 14 2009

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..4460 from Daniel Forgues)
N. Amersi, O. Beckwith, S. J. Miller, R. Ronan, and J. Sondow, Generalized Ramanujan primes, arXiv:1108.0475 [math.NT], 2011.
N. Amersi, O. Beckwith, S. J. Miller, R. Ronan, and J. Sondow, Generalized Ramanujan primes, Combinatorial and Additive Number Theory, Springer Proc. in Math. & Stat., CANT 2011 and 2012, Vol. 101 (2014), 1-13.
Ethan Berkove and Michael Brilleslyper, Subgraphs of Coprime Graphs on Sets of Consecutive Integers, Integers (2022) Vol. 22, #A47, see p. 8.
Vladimir Shevelev, On critical small intervals containing primes, arXiv:0908.2319 [math.NT], 2009.
Vladimir Shevelev, Ramanujan and Labos primes, their generalizations and classifications of primes, arXiv:0909.0715 [math.NT], 2009-2011.
Vladimir Shevelev, Ramanujan and Labos primes, their generalizations, and classifications of primes, J. Integer Seq. 15 (2012) Article 12.5.4.
Jonathan Sondow, MathWorld: Ramanujan Prime
Jonathan Sondow, Ramanujan primes and Bertrand's postulate, arXiv:0907.5232 [math.NT], 2009-2010.
Jonathan Sondow, Ramanujan primes and Bertrand's postulate, Amer. Math. Monthly, 116 (2009), 630-635.

Cf. A056171, A056169, A000720, A000142.
Cf. A104272 (Ramanujan primes).
Cf. A060756, A080360 (largest integer x with n primes in (x/2,x]).
Cf. A164554, A164288, A164333, A164294, A164372, A164371, A212493, A212541.

nn=1000; 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[3*nn]}]; Rest[t]
(* Second program: *)
a[1] = 2; a[n_] := a[n] = Module[{x = a[n-1]}, While[(PrimePi[x]-PrimePi[Quotient[x, 2]]) != n, x++ ]; x]; Array[a, 54] (* Jean-François Alcover, Sep 14 2018 *)

a(n) = {my(x = 1); while ((primepi(x) - primepi(x\2)) != n, x++;); x;} \\ Michel Marcus, Jan 15 2014

def A():
    i = 0; n = 1
    while True:
        p = prime_pi(i) - prime_pi(i//2)
        if p == n:
            yield i
            n += 1
        i += 1
A080359 = A()
[next(A080359) for n in range(54)] # Peter Luschny, Sep 03 2014

a(n) = Min{x; Pi[x]-Pi[x/2]=n} = Min{x; A056171(x)=n}=Min{x; A056169(n!)=n}; where Pi()=A000720().

a(n) <= A193507(n) (cf. A194186). - Vladimir Shevelev, Aug 18 2011

Definition corrected by Jonathan Sondow, Aug 10 2008

Shrunk title and moved part of title to comments by John W. Nicholson, Sep 18 2011

A164368 Primes p with the property: if q is the smallest prime > p/2, then a prime exists between p and 2q.

Original entry on oeis.org

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

Offset: 1

Vladimir Shevelev, Aug 14 2009

nonn

The Ramanujan primes possess the following property:
If p = prime(n) > 2, then all numbers (p+1)/2, (p+3)/2, ..., (prime(n+1)-1)/2 are composite.
The sequence equals all primes with this property, whether Ramanujan or not.
All Ramanujan primes A104272 are in the sequence.
Every lesser of twin primes (A001359), beginning with 11, is in the sequence. - Vladimir Shevelev, Aug 31 2009
109 is the first non-Ramanujan prime in this sequence.
A very simple sieve for the generation of the terms is the following: let p_0=1 and, for n>=1, p_n be the n-th prime. Consider consecutive intervals of the form (2p_n, 2p_{n+1}), n=0,1,2,... From every interval containing at least one prime we remove the last one. Then all remaining primes form the sequence. Let us demonstrate this sieve: For p_n=1,2,3,5,7,11,... consider intervals (2,4), (4,6), (6,10), (10,14), (14,22), (22,26), (26,34), ... . Removing from the set of all primes the last prime of each interval, i.e., 3,5,7,13,19,23,31,... we obtain 2,11,17,29, etc. - Vladimir Shevelev, Aug 30 2011
This sequence and A194598 are the mutually wrapping up sequences:
   A194598(1) <= a(1) <= A194598(2) <= a(2) <= ...
From Peter Munn, Oct 30 2017: (Start)
The sequence is the list of primes p = prime(k) such that there are no primes between prime(k)/2 and prime(k+1)/2. Changing "k" to "k-1" and therefore "k+1" to "k" produces a definition very similar to A164333's: it differs by prefixing an initial term 3. From this we get a(n+1) = prevprime(A164333(n)) = A151799(A164333(n)) for n >= 1.
The sequence is the list of primes that are not the largest prime less than 2*prime(k) for any k, so that - as a set - it is the complement relative to A000040 of the set of numbers in A059788.
{{2}, A166252, A166307} is a partition.
(End)

			2 is in the sequence, since then q=2, and there is a prime 3 between 2 and 4. - _N. J. A. Sloane_, Oct 15 2009

Alois P. Heinz, Table of n, a(n) for n = 1..20000
V. Shevelev, On critical small intervals containing primes, arXiv:0908.2319 [math.NT], 2009.
V. Shevelev, Ramanujan and Labos primes, their generalizations and classifications of primes, arXiv:0909.0715 [math.NT], 2009-2011.
V. Shevelev, Ramanujan and Labos primes, their generalizations, and classifications of primes, J. Integer Seq. 15 (2012) Article 12.5.4
J. Sondow, Ramanujan Prime in MathWorld
J. Sondow, J. W. Nicholson, and T. D. Noe, Ramanujan Primes: Bounds, Runs, Twins, and Gaps, arXiv:1105.2249 [math.NT], 2011 (see Section 5 Prime gaps).
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 (see Section 5 Prime gaps).

Cf. Ramanujan primes, A104272, and related sequences: A164288, A080359, A164294, A193507, A194184, A194186.
Cf. A059788, A164333, A194598.
A001359, A166252, A166307 are subsets.
Cf. A001262, A001567, A062568, A141232 (all relate to pseudoprimes to base 2).

a:= proc(n) option remember; local q, k, p;
      k:= nextprime(`if`(n=1, 1, a(n-1)));
      do q:= nextprime(floor(k/2));
         p:= nextprime(k);
         if p<2*q then break fi;
         k:= p
      od; k
    end:
seq(a(n), n=1..55);  # Alois P. Heinz, Aug 30 2011

Reap[Do[q=NextPrime[p/2]; If[PrimePi[2*q] != PrimePi[p], Sow[p]], {p, Prime[Range[100]]}]][[2, 1]]
(* Second program: *)
fQ[n_] := PrimePi[ 2NextPrime[n/2]] != PrimePi[n];
Select[ Prime@ Range@ 105, fQ]

is(n)=nextprime(n+1)<2*nextprime(n/2) && isprime(n) \\ Charles R Greathouse IV, Apr 24 2015

As a set, this sequence = A000040 \ A059788 = A000040 \ prevprime(2*A000040) = A000040 \ A151799(A005843(A000040)). - Peter Munn, Oct 30 2017

Definition clarified and simplified by Jonathan Sondow, Oct 25 2011

A194598 Union of A080359 and A164294.

Original entry on oeis.org

2, 3, 13, 19, 31, 43, 53, 61, 71, 73, 101, 103, 109, 113, 131, 139, 151, 157, 173, 181, 191, 193, 199, 229, 233, 239, 241, 251, 269, 271, 283, 293, 311, 313, 349, 353, 373, 379, 409, 419, 421, 433, 439, 443, 463, 491, 499, 509, 523, 571, 577, 593, 599, 601

Offset: 1

Vladimir Shevelev, Aug 30 2011

nonn

Every greater of twin primes (A006512), beginning with 13, is in the sequence.
A very simple sieve for the generation of the terms is the following: Let p_n be the n-th prime. Consider consecutive intervals of the form (2p_n, 2p_{n+1}), n=1,2,... From every interval containing at least one prime we take the first one and remove it from the set of all primes. Then all remaining primes form the sequence. Let us demonstrate this sieve: For primes 2,3,5,7,11,... consider intervals (4,6), (6,10), (10,14), (14,22), (22,26), (26,34), ... . Removing from the set of all primes the first prime of each interval, i.e., 5,7,11,17,23,29,... ,we obtain 2,3,13,19,31, etc.
This sequence and A164368 are the mutually wrapping up sequences:
   a(1) <= A164368(1) <= a(2) <= A164368(2) <= ...
Following the steps to generate T(n,1) in A229608 provides an alternate method of generating this sequence. - Bob Selcoe, Oct 27 2015

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.
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, arXiv:1105.2249 [math.NT], 2011.
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. A080359, A164294, A164368, A193507, A194186, A212493, A212541, A229608.

If the first two terms are omitted we get A164333.

primePiMax = 200;
Join[{2, 3}, Select[Table[{(Prime[k-1] + 1)/2, (Prime[k] - 1)/2}, {k, 3, primePiMax}], AllTrue[Range[#[[1]], #[[2]]], CompositeQ]&][[All, 2]]*2+1] (* Jean-François Alcover, Aug 18 2018 *)

First column of array A229608. - Bob Selcoe, Oct 27 2015

For n >= 3, a(n) = A164333(n-2). - Peter Munn, Aug 30 2017

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 *)

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 *)

A194674 Positions of nonzero terms of A194659(n)-A194186(n+1), n>=1.

Original entry on oeis.org

20, 27, 73, 77, 85, 95, 106, 116, 117, 122, 125, 132, 137, 144, 145, 152, 162, 167, 168, 189, 191, 192, 193, 198, 201, 208, 213, 234, 235, 236, 243, 249, 258, 259, 265, 275, 279, 286, 287, 291, 318, 319, 321, 329, 330, 331, 340

Offset: 1

Vladimir Shevelev, Sep 01 2011

nonn

The sequence (together with A194953) characterizes a right-left symmetry in the distribution of primes over intervals (2*p_n, 2*p_(n+1)), n=1,2,..., where p_n is the n-th prime.

V. Shevelev, Ramanujan and Labos primes, their generalizations and classifications of primes

Cf. A104272, A080359, A193507, A194186, A164368, A194598, A194658, A194659, A194953, A164288, A164294.

A229608 Square array read by antidiagonals downwards: each row starts with the least prime not in a previous row, and each prime p in a row is followed by the least prime > 2*p.

Original entry on oeis.org

2, 5, 3, 11, 7, 13, 23, 17, 29, 19, 47, 37, 59, 41, 31, 97, 79, 127, 83, 67, 43, 197, 163, 257, 167, 137, 89, 53, 397, 331, 521, 337, 277, 179, 107, 61, 797, 673, 1049, 677, 557, 359, 223, 127, 71, 1597, 1361, 2099, 1361, 1117, 719, 449, 257, 149, 73, 3203

Offset: 1

Clark Kimberling, Sep 26 2013

Conjectures: (row 1) = A055496, (column 1) = A193507, and for each row r(k), the limit of r(k)/2^k exists. For rows 1 to 4, the respective limits are 1.569985..., 2.677285..., 8.230592..., 10.709142...; see Franklin T. Adams-Watters's comment at A055496.
The above conjecture row 1 = A055496 is true; additionally, row 2 = A065545; row 3 = A065546; the first 5 terms of row 6 are a contiguous subsequence of A064934; and column 1 = A194598. - Bob Selcoe, Oct 27 2015; corrected by Peter Munn, Jul 30 2017
The conjecture for column 1 is true iff A194598 and A193507 are equivalent. Is this the case? - Bob Selcoe, Oct 29 2015
Column 1 diverges from A193507 at A(14,1) = 113, a prime not in A193507. 113 is in column 1 as it does not follow a prime in a row: 107 follows 53 and 127 follows 59, the next prime after 53. - Peter Munn, Jul 30 2017

			Northwest corner:
    2    5   11   23   47   97  197
    3    7   17   37   79  163  331
   13   29   59  127  257  521 1049
   19   41   83  167  337  677 1361
   31   67  137  277  557 1117 2237
   43   89  179  359  719 1439 2879
   53  107  223  449  907 1823 3659

Cf. A055496, A193507, A229607, A229609, A229610.

Cf. A065545, A065546, A064934, A194598.

seqL = 14; arr2[1] = {2}; Do[AppendTo[arr2[1], NextPrime[2*Last[arr2[1]]]], {seqL}];
Do[tmp = Union[Flatten[Map[arr2, Range[z]]]]; arr2[z] = {Prime[NestWhile[# + 1 &, 1, PrimePi[tmp[[#]]] - # == 0 &]]}; Do[AppendTo[arr2[z], NextPrime[2*Last[arr2[z]]]], {seqL}], {z, 2, 12}]; m = Map[arr2, Range[12]]; m // TableForm
t = Table[m[[n - k + 1]][[k]], {n, 12}, {k, n, 1, -1}] // Flatten (* Peter J. C. Moses, Sep 26 2013 *)

Incorrect comment deleted and example extended by Peter Munn, Jul 30 2017

cp's OEIS Frontend

A194186 a(n) = A193507(n) - A080359(n).

Views

Author

Keywords

Comments

Links

Crossrefs

A194184 a(n) = A104272(n)-A193507(n).

Views

Author

Keywords

Comments

Links

Crossrefs

A080359 The smallest integer x > 0 such that the number of primes in (x/2, x] equals n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

Extensions

A164368 Primes p with the property: if q is the smallest prime > p/2, then a prime exists between p and 2q.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A194598 Union of A080359 and A164294.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

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

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

Views

Author

Keywords

Comments

Crossrefs

Programs

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.

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.