A117078 -id:A117078 - cp's OEIS frontend

A118741 Primes for which the weight as defined in A117078 is 7.

67, 83, 167, 193, 251, 277, 433, 487, 503, 587, 601, 613, 727, 823, 907, 1063, 1217, 1231, 1553, 1663, 1777, 1861, 1873, 1973, 1987, 2083, 2281, 2293, 2351, 2377, 2393, 2797, 2897, 3217, 3343, 3541, 3847, 4073, 4283, 4451, 4507, 4591, 4813, 4871, 5081

Offset: 1

Rémi Eismann, May 22 2006; May 27 2006; May 04 2007

nonn

The gap as defined in A001223 of this prime numbers is 4 or 6.

The prime numbers in this sequence are of the form (14i-1) (if gap=6) or (14i-3) (if gap=4) with i=(level(n)+1)/2, level(n) defined in A117563.

Remi Eismann, Table of n, a(n) for n=1..10000

Cf. A117078, A117563, A118922, A118924.

f[n_] := Block[{a, p = Prime[n], np = Prime[n + 1]}, a = Min[Select[Divisors[2*p - np], #1 > np - p & ]]; If[a == Infinity, 0, a]]; Prime@ Select[ Range@695, f@# == 7 &] (* Robert G. Wilson v, May 26 2006 *)

A117078 : a(n) = smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists. prime(n) for which k=7.

More terms from Robert G. Wilson v, May 26 2006

A119593 Primes for which the weight as defined in A117078 is 7 and the gap as defined in A001223 is 4.

Original entry on oeis.org

67, 193, 277, 487, 613, 823, 907, 1663, 1873, 2083, 2293, 2377, 2797, 3217, 3343, 3847, 4813, 5233, 5527, 5653, 5737, 6577, 6997, 7207, 7753, 8677, 8803, 9433, 11113, 11617

Offset: 1

Rémi Eismann, Jun 01 2006, May 04 2007

The prime numbers in this sequence are of the form (14i-3) with i=(level(n)+1)/2, level(n) defined in A117563.

Remi Eismann, Table of n, a(n) for n=1..10000

Cf. A117078, A001223, A117563, A001359, A118359, A074822, A118922, A118924, A119504.

forprimestep(p=67,1e4,14, t=p%5; if((t==2 || t==3) && isprime(p+4), print1(p", "))) \\ Charles R Greathouse IV, Sep 17 2022

p=67; forprime(q=p+2,1e4, if(q-p==4 && (p%70==53 || p%70==67), print1(p", ")); p=q) \\ Charles R Greathouse IV, Sep 17 2022

Primes p such that (1) p = 53 or 67 mod 70 and (2) p+4 is prime. - Charles R Greathouse IV, Sep 17 2022

a(n) = Omega(n log^2 n). - Charles R Greathouse IV, Sep 17 2022

A119594 Primes for which the weight as defined in A117078 is 9 and the gap as defined in A001223 is 4.

Original entry on oeis.org

13, 103, 463, 643, 877, 967, 1093, 1597, 1867, 1993, 2137, 2857, 3037, 3163, 3253, 3613, 3793, 4153, 4513, 4783, 5413, 5503, 5647, 6007, 6043, 6547, 6907, 7537, 7573, 7933, 8167, 8293, 9157, 9337, 9463, 9787

Offset: 1

Rémi Eismann, Jun 01 2006, May 04 2007

nonn

The prime numbers in this sequence are of the form (18i-5) with i=(level(n)+1)/2, level(n) defined in A117563.

			a(1)=13 because of 17=13+mod(13;9) and 17-13=4.
18*1-5=13, level=1
a(2)=103 because of 107=103+mod(103;9) and 107-103=4
18*((11+1)/2)-5=103, level=11

Remi Eismann, Table of n, a(n) for n=1..10000

Cf. A117078, A001223, A117563, A001359, A118359, A074822, A118922, A118924, A119504.

A121155 Primes for which A117078(n) is equal to A117563(n) and A117563(n) is different from 0.

Original entry on oeis.org

11, 89, 367, 3727, 5059, 7927, 38821, 94261, 160807, 727621, 908221, 942847, 1274671, 1985287, 2042059, 2105407, 2411821, 4068301, 4464781, 4748077, 5004193, 5331511, 5678713, 5755219, 7349527, 8288647, 9138541, 9369727

Offset: 1

Rémi Eismann, Aug 13 2006; corrected Oct 11 2006, Sep 16 2008

nonn

A118534(n) = A117078(n) * A117563(n) = A117078(n)^2 = A117563(n)^2.

			Prime(6) = prime (5) + mod(prime(5);3) = prime (5) + mod(prime(5);9), level(5)=9/3=3, A117078(5) = A117563(5) = 3.
Prime(369935) = prime (369934) + mod(prime(369934); 2309) = prime (369934) + mod(prime(369934); 5331481), level(369934)=5331481/2309=2309, A117078(369934) = A117563(369934) = 2309.

Remi Eismann, Table of n, a(n) for n = 1..184

Cf. A117078, A117563, A118534.

More terms from Fabien Sibenaler, Oct 20 2006

A001223 Prime gaps: differences between consecutive primes.

Original entry on oeis.org

1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2, 10, 14, 4, 2, 4, 14, 6, 10, 2, 4, 6, 8, 6, 6, 4, 6, 8, 4, 8, 10, 2, 10, 2, 6, 4, 6, 8, 4, 2, 4, 12, 8, 4, 8, 4, 6, 12

Offset: 1

N. J. A. Sloane

There is a unique decomposition of the primes: provided the weight A117078(n) is > 0, we have prime(n) = weight * level + gap, or A000040(n) = A117078(n) * A117563(n) + a(n). - Rémi Eismann, Feb 14 2008
Let rho(m) = A179196(m), for any n, let m be an integer such that p_(rho(m)) <= p_n and p_(n+1) <= p_(rho(m+1)), then rho(m) <= n < n + 1 <= rho(m + 1), therefore a(n) = p_(n+1) - p_n <= p_rho(m+1) - p_rho(m) = A182873(m). For all rho(m) = A179196(m), a(rho(m)) < A165959(m). - John W. Nicholson, Dec 14 2011
A solution (modular square root) of x^2 == A001248(n) (mod A000040(n+1)). - L. Edson Jeffery, Oct 01 2014
There exists a constant C such that for n -> infinity, Cramer conjecture a(n) < C log^2 prime(n) is equivalent to (log prime(n+1)/log prime(n))^n < e^C. - Thomas Ordowski, Oct 11 2014
a(n) = A008347(n+1) - A008347(n-1). - Reinhard Zumkeller, Feb 09 2015
Yitang Zhang proved lim inf_{n -> infinity} a(n) is finite. - Robert Israel, Feb 12 2015
lim sup_{n -> infinity} a(n)/log^2 prime(n) = C <==> lim sup_{n -> infinity}(log prime(n+1)/log prime(n))^n = e^C. - Thomas Ordowski, Mar 09 2015
a(A038664(n)) = 2*n and a(m) != 2*n for m < A038664(n). - Reinhard Zumkeller, Aug 23 2015
If j and k are positive integers then there are no two consecutive primes gaps of the form 2+6j and 2+6k (A016933) or 4+6j and 4+6k (A016957). - Andres Cicuttin, Jul 14 2016
Conjecture: For any positive numbers x and y, there is an index k such that x/y = a(k)/a(k+1). - Andres Cicuttin, Sep 23 2018
Conjecture: For any three positive numbers x, y and j, there is an index k such that x/y = a(k)/a(k+j). - Andres Cicuttin, Sep 29 2018
Conjecture: For any three positive numbers x, y and j, there are infinitely many indices k such that x/y = a(k)/a(k+j). - Andres Cicuttin, Sep 29 2018
Row m of A174349 lists all indices n for which a(n) = 2m. - M. F. Hasler, Oct 26 2018
Since (6a, 6b) is an admissible pattern of gaps for any integers a, b > 0 (and also if other multiples of 6 are inserted in between), the above conjecture follows from the prime k-tuple conjecture which states that any admissible pattern occurs infinitely often (see, e.g., the Caldwell link). This also means that any subsequence a(n .. n+m) with n > 2 (as to exclude the untypical primes 2 and 3) should occur infinitely many times at other starting points n'. - M. F. Hasler, Oct 26 2018
Conjecture: Defining b(n,j,k) as the number of pairs of prime gaps {a(i),a(i+j)} such that i < n, j > 0, and a(i)/a(i+j) = k with k > 0, then
  lim_{n -> oo} b(n,j,k)/b(n,j,1/k) = 1, for any j > 0 and k > 0, and
  lim_{n -> oo} b(n,j,k1)/b(n,j,k2) = C with C = C(j,k1,k2) > 0. - Andres Cicuttin, Sep 01 2019

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 92.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 186-192.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vojtech Strnad, First 100000 terms [First 10000 terms from N. J. A. Sloane]
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Anonymous ["TheHereticAnthem20"], Prime gaps mapped to sounds, Youtube video (2018).
B. Apostol, L. Panaitopol, L Petrescu, and L. Toth, Some Properties of a Sequence Defined with the Aid of Prime Numbers, J. Int. Seq. 18 (2015) # 15.5.5.
S. Ares and M. Castro, Hidden structure in the randomness of the prime number sequence?, arXiv:cond-mat/0310148 [cond-mat.stat-mech], 2003-2005.
József Beck, Inevitable randomness in discrete mathematics, University Lecture Series, 49. American Mathematical Society, Providence, RI, 2009. xii+250 pp. ISBN: 978-0-8218-4756-5; MR2543141 (2010m:60026). See page 7.
Chris K. Caldwell, Prime k-tuple conjecture, Prime Pages' Glossary entry.
Joel E. Cohen and Dexter Senft, Gaps of size 2, 4, and (conditionally) 6 between successive odd composite numbers occur infinitely often, Notes on Number Theory and Discrete Mathematics, Volume 31, Number 3, 494-503 (2025). See p. 495.
Péter L. Erdős, Gergely Harcos, Shubha R. Kharel, Péter Maga, Tamás Róbert Mezei and Zoltán Toroczkai, The sequence of prime gaps is graphic, Mathematische Annalen 388 (2024), 2195-2215.
D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yildirim, Small gaps between primes and almost primes, arXiv:math/0506067 [math.NT], 2005.
D. A. Goldston and A. H. Ledoan, On the differences between consecutive prime numbers, I", arXiv:1111.3380v1 [math.NT], Nov 14, 2011.
D. A. Goldston, J. Pintz, and C. Y. Yildirim, Positive Proportion of Small Gaps Between Consecutive Primes, arXiv:1103.3986 [math.NT], Mar 21, 2011.
D. R. Heath-Brown and H. Iwaniec, On the difference between consecutive primes, Bull. Amer. Math. Soc. 1 (1979), 758-760.
Alexei Kourbatov, Tables of record gaps between prime constellations, arXiv preprint arXiv:1309.4053 [math.NT], 2013.
Alexei Kourbatov, The distribution of maximal prime gaps in Cramer's probabilistic model of primes, arXiv preprint arXiv:1401.6959 [math.NT], 2014.
The Polymath project, Bounded gaps between primes
Carlos Rivera, Conjecture 82. Average of log Dn / log(logPn) equal R = 0,877 08..., The Prime Puzzles & Problems Connection.
Hisanobu Shinya, On the density of prime differences less than a given magnitude which satisfy a certain inequality, arXiv:0809.3458 [math.GM], 2008-2011.
K. Soundararajan, Small gaps between prime numbers: the work of Goldston-Pintz-Yildirim, Bull. Amer. Math. Soc., 44 (2007), 1-18.
Eric Weisstein's World of Mathematics, Andrica's Conjecture
Eric Weisstein's World of Mathematics, Prime Difference Function
Yasuo Yamasaki and Aiichi Yamasaki, On the Gap Distribution of Prime Numbers, Kyoto University Research Information Repository, October 1994. MR1370273 (97a:11141).
Yitang Zhang, Bounded gaps between primes, Annals of Mathematics 179 (2014), 1121-1174.
Index entries for primes, gaps between

Cf. A000040 (primes), A001248 (primes squared), A000720, A037201, A007921, A030173, A036263-A036274, A167770, A008347.
Second difference is A036263, first occurrence is A000230.
For records see A005250, A005669.
Cf. A038664, A031131, A031165, A031166, A031167, A031168, A031169, A031170, A031171, A031172.
Cf. A174349, A029707, A029709, A320701, ..., A320720.
Sequences related to the differences between successive primes: A001223 (Delta(p)), A028334, A080378, A104120, A330556-A330561.

a001223 n = a001223_list !! (n-1)
a001223_list = zipWith (-) (tail a000040_list) a000040_list
-- Reinhard Zumkeller, Oct 29 2011

[(NthPrime(n+1) - NthPrime(n)): n in [1..100]]; // Vincenzo Librandi, Apr 02 2011

with(numtheory): for n from 1 to 500 do printf(`%d,`,ithprime(n+1) - ithprime(n)) od:

Differences[Prime[Range[100]]] (* Harvey P. Dale, May 15 2011 *)

diff(v)=vector(#v-1,i,v[i+1]-v[i]);
diff(primes(100)) \\ Charles R Greathouse IV, Feb 11 2011

forprime(p=1, 1e3, print1(nextprime(p+1)-p, ", ")) \\ Felix Fröhlich, Sep 06 2014

from sympy import prime
def A001223(n): return prime(n+1)-prime(n) # Chai Wah Wu, Jul 07 2022

differences(prime_range(1000)) # Joerg Arndt, May 15 2011

G.f.: b(x)*(1-x), where b(x) is the g.f. for the primes. - Franklin T. Adams-Watters, Jun 15 2006
a(n) = prime(n+1) - prime(n). - Franklin T. Adams-Watters, Mar 31 2010
Conjectures: (i) a(n) = ceiling(prime(n)*log(prime(n+1)/prime(n))). (ii) a(n) = floor(prime(n+1)*log(prime(n+1)/prime(n))). (iii) a(n) = floor((prime(n)+prime(n+1))*log(prime(n+1)/prime(n))/2). - Thomas Ordowski, Mar 21 2013
A167770(n) == a(n)^2 (mod A000040(n+1)). - L. Edson Jeffery, Oct 01 2014
a(n) = Sum_{k=1..2^(n+1)-1} (floor(cos^2(Pi*(n+1)^(1/(n+1))/(1+primepi(k))^(1/(n+1))))). - Anthony Browne, May 11 2016
G.f.: (Sum_{k>=1} x^pi(k)) - 1, where pi(k) is the prime counting function. - Benedict W. J. Irwin, Jun 13 2016
Conjecture: Limit_{N->oo} (Sum_{n=2..N} log(a(n))) / (Sum_{n=2..N} log(log(prime(n)))) = 1. - Alain Rocchelli, Dec 16 2022
Conjecture: The asymptotic limit of the average of log(a(n)) ~ log(log(prime(n))) - gamma (where gamma is Euler's constant). Also, for n tending to infinity, the geometric mean of a(n) is equivalent to log(prime(n)) / e^gamma. - Alain Rocchelli, Jan 23 2023
It has been conjectured that primes are distributed around their average spacing in a Poisson distribution (cf. D. A. Goldston in above links). This is the basis of the last two conjectures above. - Alain Rocchelli, Feb 10 2023

More terms from James Sellers, Feb 19 2001

A001359 Lesser of twin primes.

Original entry on oeis.org

3, 5, 11, 17, 29, 41, 59, 71, 101, 107, 137, 149, 179, 191, 197, 227, 239, 269, 281, 311, 347, 419, 431, 461, 521, 569, 599, 617, 641, 659, 809, 821, 827, 857, 881, 1019, 1031, 1049, 1061, 1091, 1151, 1229, 1277, 1289, 1301, 1319, 1427, 1451, 1481, 1487, 1607

Offset: 1

N. J. A. Sloane

Also, solutions to phi(n + 2) = sigma(n). - Conjectured by Jud McCranie, Jan 03 2001; proved by Reinhard Zumkeller, Dec 05 2002
The set of primes for which the weight as defined in A117078 is 3 gives this sequence except for the initial 3. - Rémi Eismann, Feb 15 2007
The set of lesser of twin primes larger than three is a proper subset of the set of primes of the form 3n - 1 (A003627). - Paul Muljadi, Jun 05 2008
It is conjectured that A113910(n+4) = a(n+2) for all n. - Creighton Dement, Jan 15 2009
I would like to conjecture that if f(x) is a series whose terms are x^n, where n represents the terms of sequence A001359, and if we inspect {f(x)}^5, the conjecture is that every term of the expansion, say a_n * x^n, where n is odd and at least equal to 15, has a_n >= 1. This is not true for {f(x)}^k, k = 1, 2, 3 or 4, but appears to be true for k >= 5. - Paul Bruckman (pbruckman(AT)hotmail.com), Feb 03 2009
A164292(a(n)) = 1; A010051(a(n) - 2) = 0 for n > 1. - Reinhard Zumkeller, Mar 29 2010
From Jonathan Sondow, May 22 2010: (Start)
About 15% of primes < 19000 are the lesser of twin primes. About 26% of Ramanujan primes A104272 < 19000 are the lesser of twin primes.
About 46% of primes < 19000 are Ramanujan primes. About 78% of the lesser of twin primes < 19000 are Ramanujan primes.
A reason for the jumps is in Section 7 of "Ramanujan primes and Bertrand's postulate" and in Section 4 of "Ramanujan Primes: Bounds, Runs, Twins, and Gaps". (End)
Primes generated by sequence A040976. - Odimar Fabeny, Jul 12 2010
Primes of the form 2*n - 3 with 2*n - 1 prime n > 2. Primes of the form (n^2 - (n-2)^2)/2 - 1 with (n^2 - (n-2)^2)/2 + 1 prime so sum of two consecutive odd numbers/2 - 1. - Pierre CAMI, Jan 02 2012
Conjecture: For any integers n >= m > 0, there are infinitely many integers b > a(n) such that the number Sum_{k=m..n} a(k)*b^(n-k) (i.e., (a(m), ..., a(n)) in base b) is prime; moreover, when m = 1 there is such an integer b < (n+6)^2. - Zhi-Wei Sun, Mar 26 2013
Except for the initial 3, all terms are congruent to 5 mod 6. One consequence of this is that no term of this sequence appears in A030459. - Alonso del Arte, May 11 2013
Aside from the first term, all terms have digital root 2, 5, or 8. - J. W. Helkenberg, Jul 24 2013
The sequence provides all solutions to the generalized Winkler conjecture (A051451) aside from all multiples of 6. Specifically, these solutions start from n = 3 as a(n) - 3. This gives 8, 14, 26, 38, 56, ... An example from the conjecture is solution 38 from twin prime pairs (3, 5), (41, 43). - Bill McEachen, May 16 2014
Conjecture: a(n)^(1/n) is a strictly decreasing function of n. Namely a(n+1)^(1/(n+1)) < a(n)^(1/n) for all n. This conjecture is true for all a(n) <= 1121784847637957. - Jahangeer Kholdi and Farideh Firoozbakht, Nov 21 2014
a(n) are the only primes, p(j), such that (p(j+m) - p(j)) divides (p(j+m) + p(j)) for some m > 0, where p(j) = A000040(j). For all such cases m=1. It is easy to prove, for j > 1, the only common factor of (p(j+m) - p(j)) and (p(j+m) + p(j)) is 2, and there are no common factors if j = 1. Thus, p(j) and p(j+m) are twin primes. Also see A067829 which includes the prime 3. - Richard R. Forberg, Mar 25 2015
Primes prime(k) such that prime(k)! == 1 (mod prime(k+1)) with the exception of prime(991) = 7841 and other unknown primes prime(k) for which (prime(k)+1)*(prime(k)+2)*...*(prime(k+1)-2) == 1 (mod prime(k+1)) where prime(k+1) - prime(k) > 2. - Thomas Ordowski and Robert Israel, Jul 16 2016
For the twin prime criterion of Clement see the link. In Ribenboim, pp. 259-260 a more detailed proof is given. - Wolfdieter Lang, Oct 11 2017
Conjecture: Half of the twin prime pairs can be expressed as 8n + M where M > 8n and each value of M is a distinct composite integer with no more than two prime factors. For example, when n=1, M=21 as 8 + 21 = 29, the lesser of a twin prime pair. - Martin Michael Musatov, Dec 14 2017
For a discussion of bias in the distribution of twin primes, see my article on the Vixra web site. - Waldemar Puszkarz, May 08 2018
Since 2^p == 2 (mod p) (Fermat's little theorem), these are primes p such that 2^p == q (mod p), where q is the next prime after p. - Thomas Ordowski, Oct 29 2019, edited by M. F. Hasler, Nov 14 2019
The yet unproved "Twin Prime Conjecture" states that this sequence is infinite. - M. F. Hasler, Nov 14 2019
Lesser of the twin primes are the set of elements that occur in both A162566, A275697. Proof: A prime p will only have integer solutions to both (p+1)/g(p) and (p-1)/g(p) when p is the lesser of a twin prime, where g(p) is the gap between p and the next prime, because gcd(p+1,p-1) = 2. - Ryan Bresler, Feb 14 2021
From Lorenzo Sauras Altuzarra, Dec 21 2021: (Start)
J. A. Hervás Contreras observed the subsequence 11, 311, 18311, 1518311, 421518311... (see the links), which led me to conjecture the following statements.
I. If i is an integer greater than 2, then there exist positive integers j and k such that a(j) equals the concatenation of 3k and a(i).
II. If k is a positive integer, then there exist positive integers i and j such that a(j) equals the concatenation of 3k and a(i).
III. If i, j, and r are positive integers such that i > 2 and a(j) equals the concatenation of r and a(i), then 3 divides r. (End)

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 6.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §3.2 Prime Numbers, p. 81.
Paulo Ribenboim, The New Book of Prime Number Records, Springer-Verlag NY 1996, pp. 259-260.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 192-197.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 111-112.

Chris K. Caldwell, Table of n, a(n) for n = 1..100000
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Abhinav Aggarwal, Zekun Xu, Oluwaseyi Feyisetan, and Nathanael Teissier, On Primes, Log-Loss Scores and (No) Privacy, arXiv:2009.08559 [cs.LG], 2020.
Chris K. Caldwell, First 100000 Twin Primes
Chris K. Caldwell, Twin Primes
Chris K. Caldwell, Largest known twin primes
Chris K. Caldwell, Twin primes
Chris K. Caldwell, The prime pages
P. A. Clement, Congruences for sets of primes, American Mathematical Monthly, vol. 56,1 (1949), 23-25.
Harvey Dubner, Twin Prime Statistics, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.2.
Andrew Granville and Greg Martin, Prime number races, arXiv:math/0408319 [math.NT], 2004; Amer. Math. Monthly, 113 (No. 1, 2006), 1-33.
José Antonio Hervás Contreras, ¿Nueva propiedad de los primos gemelos?
Thomas R. Nicely, Some Results of Computational Research in Prime Numbers [See local copy in A007053]
Thomas R. Nicely, Enumeration to 10^14 of the twin primes and Brun's constant, Virginia Journal of Science, 46:3 (Fall, 1995), 195-204.
Thomas R. Nicely, Enumeration to 10^14 of the twin primes and Brun's constant [Local copy, pdf only]
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Waldemar Puszkarz, Statistical Bias in the Distribution of Prime Pairs and Isolated Primes, vixra:1804.0416 (2018).
Fred Richman, Generating primes by the sieve of Eratosthenes
Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
P. Shiu, A Diophantine Property Associated with Prime Twins, Experimental mathematics 14 (1) (2005).
Jonathan Sondow, Ramanujan primes and Bertrand's postulate, arXiv:0907.5232 [math.NT], 2009-2010; Amer. Math. Monthly, 116 (2009) 630-635.
Jonathan 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.
Jonathan Sondow and Emmanuel Tsukerman, The p-adic order of power sums, the Erdos-Moser equation, and Bernoulli numbers, arXiv:1401.0322 [math.NT], 2014; see section 4.
Terence Tao, Obstructions to uniformity and arithmetic patterns in the primes, arXiv:math/0505402 [math.NT], 2005.
Apoloniusz Tyszka, On sets X subset of N for which we know an algorithm that computes a threshold number t(X) in N such that X is infinite if and only if X contains an element greater than t(X), 2019.
Eric Weisstein's World of Mathematics, Twin Primes
Index entries for primes, gaps between

Subsequence of A003627.
Cf. A001223, A006512 (greater of twin primes), A014574, A001097, A077800, A002822, A040040, A054735, A067829, A082496, A088328, A117078, A117563, A074822, A071538, A007508, A146214, A350246, A350247.
Cf. A104272 (Ramanujan primes), A178127 (lesser of twin Ramanujan primes), A178128 (lesser of twin primes if it is a Ramanujan prime).
Cf. A010051, A000040.

a001359 n = a001359_list !! (n-1)
a001359_list = filter ((== 1) . a010051' . (+ 2)) a000040_list
-- Reinhard Zumkeller, Feb 10 2015

[n: n in PrimesUpTo(1610) | IsPrime(n+2)];  // Bruno Berselli, Feb 28 2011

select(k->isprime(k+2),select(isprime,[$1..1616])); # Peter Luschny, Jul 21 2009
A001359 := proc(n)
   option remember;
   if n = 1
      then 3;
   else
      p := nextprime(procname(n-1)) ;
      while not isprime(p+2) do
         p := nextprime(p) ;
      end do:
      p ;
   end if;
end proc: # R. J. Mathar, Sep 03 2011

Select[Prime[Range[253]], PrimeQ[# + 2] &] (* Robert G. Wilson v, Jun 09 2005 *)
a[n_] := a[n] = (p = NextPrime[a[n - 1]]; While[!PrimeQ[p + 2], p = NextPrime[p]]; p); a[1] = 3; Table[a[n], {n, 51}]  (* Jean-François Alcover, Dec 13 2011, after R. J. Mathar *)
nextLesserTwinPrime[p_Integer] := Block[{q = p + 2}, While[NextPrime@ q - q > 2, q = NextPrime@ q]; q]; NestList[nextLesserTwinPrime@# &, 3, 50] (* Robert G. Wilson v, May 20 2014 *)
Select[Partition[Prime[Range[300]],2,1],#[[2]]-#[[1]]==2&][[All,1]] (* Harvey P. Dale, Jan 04 2021 *)
q = Drop[Prepend[p = Prime[Range[100]], 2], -1];
Flatten[q[[#]] & /@ Position[p - q, 2]] (* Horst H. Manninger, Mar 28 2021 *)

A001359(n,p=3) = { while( p+2 < (p=nextprime( p+1 )) || n-->0,); p-2}
/* The following gives a reasonably good estimate for any value of n from 1 to infinity; compare to A146214. */
A001359est(n) = solve( x=1,5*n^2/log(n+1), 1.320323631693739*intnum(t=2.02,x+1/x,1/log(t)^2)-log(x) +.5 - n)
/* The constant is A114907; the expression in front of +.5 is an estimate for A071538(x) */ \\  M. F. Hasler, Dec 10 2008

from sympy import primerange, isprime
print([n for n in primerange(1, 2001) if isprime(n + 2)]) # Indranil Ghosh, Jul 20 2017

a(n) = A077800(2n-1).
A001359 = { n | A071538(n-1) = A071538(n)-1 }; A071538(A001359(n)) = n. - M. F. Hasler, Dec 10 2008
A001359 = { prime(n) : A069830(n) = A087454(n) }. - Juri-Stepan Gerasimov, Aug 23 2011
a(n) = prime(A029707(n)). - R. J. Mathar, Feb 19 2017

A006562 Balanced primes (of order one): primes which are the average of the previous prime and the following prime.

Original entry on oeis.org

5, 53, 157, 173, 211, 257, 263, 373, 563, 593, 607, 653, 733, 947, 977, 1103, 1123, 1187, 1223, 1367, 1511, 1747, 1753, 1907, 2287, 2417, 2677, 2903, 2963, 3307, 3313, 3637, 3733, 4013, 4409, 4457, 4597, 4657, 4691, 4993, 5107, 5113, 5303, 5387, 5393

Offset: 1

N. J. A. Sloane and Robert G. Wilson v

Subsequence of A075540. - Franklin T. Adams-Watters, Jan 11 2006
This subsequence of A125830 and of A162174 gives primes of level (1,1): More generally, the i-th prime p(i) is of level (1,k) if and only if it has level 1 in A117563 and 2 p(i) - p(i+1) = p(i-k). - Rémi Eismann, Feb 15 2007
Note the similarity between plots of A006562 and A013916. - Bill McEachen, Sep 07 2009
Balanced primes U strong primes = good primes. Or, A006562 U A051634 = A046869. - Juri-Stepan Gerasimov, Mar 01 2010
Primes prime(n) such that A001223(n-1) = A001223(n). - Irina Gerasimova, Jul 11 2013
Numbers m such that A346399(m) is odd and >= 3. - Ya-Ping Lu, Dec 26 2021 and May 07 2024
"Balanced" means that the next and preceding gap are of the same size, i.e., the second difference A036263 vanishes; so these are the primes whose indices are 1 more than indices of zeros in A036263, listed in A064113. - M. F. Hasler, Oct 15 2024
Primes which are the average of three consecutive primes. - Peter Schorn, Apr 30 2025

			5 belongs to the sequence because 5 = (3 + 7)/2. Likewise 53 = (47 + 59)/2.
5 belongs to the sequence because it is a term, but not first or last, of the AP of consecutive primes (3, 5, 7).
53 belongs to the sequence because it is a term, but not first or last, of the AP of consecutive primes (47, 53, 59).
257 and 263 belong to the sequence because they are terms, but not first or last, of the AP of consecutive primes (251, 257, 263, 269).

A. Murthy, Smarandache Notions Journal, Vol. 11 N. 1-2-3 Spring 2000.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 134.

T. D. Noe, Table of n, a(n) for n = 1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, p. 870.
Ernest G. Hibbs, Component Interactions of the Prime Numbers, Ph. D. Thesis, Capitol Technology Univ. (2022), see p. 33.
Shubhankar Paul, Ten Problems of Number Theory, International Journal of Engineering and Technical Research (IJETR), ISSN: 2321-0869, Volume-1, Issue-9, November 2013.
Shubhankar Paul, Legendre, Grimm, Balanced Prime, Prime triple, Polignac's conjecture, a problem and 17 tips with proof to solve problems on number theory, International Journal of Engineering and Technical Research (IJETR), ISSN: 2321-0869, Volume-1, Issue-10, December 2013.
Wikipedia, Balanced prime.

Primes A000040 whose indices are 1 more than A064113, indices of zeros in A036263 (second differences of the primes).
Cf. A082077, A082078, A082079, A096697, A096698, A096699, A096700, A096701, A096702, A096703, A096704, A096693, A051634, A051635, A054342, A117078, A117563, A125830, A117876, A125576, A046869, A173891, A173892, A173893, A006560, A075540.
Cf. A225494 (multiplicative closure); complement of A178943 with respect to A000040.
Cf. A055380, A051795, A081415, A096710 for other balanced prime sequences.

a006562 n = a006562_list !! (n-1)
a006562_list = filter ((== 1) . a010051) a075540_list
-- Reinhard Zumkeller, Jan 20 2012

a006562 n = a006562_list !! (n-1)
a006562_list = h a000040_list where
   h (p:qs@(q:r:ps)) = if 2 * q == (p + r) then q : h qs else h qs
-- Reinhard Zumkeller, May 09 2013

[a: n in [1..1000] | IsPrime(a) where a is NthPrime(n)-NthPrime(n+1)+NthPrime(n+2)]; // Vincenzo Librandi, Jun 23 2016

Transpose[ Select[ Partition[ Prime[ Range[1000]], 3, 1], #[[2]] ==(#[[1]] + #[[3]])/2 &]][[2]]
p=Prime[Range[1000]]; p[[Flatten[1+Position[Differences[p, 2], 0]]]]
Prime[#]&/@SequencePosition[Differences[Prime[Range[800]]],{x_,x_}][[All,2]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jan 31 2019 *)

betwixtpr(n) = { local(c1,c2,x,y); for(x=2,n, c1=c2=0; for(y=prime(x-1)+1,prime(x)-1, if(!isprime(y),c1++); ); for(y=prime(x)+1,prime(x+1)-1, if(!isprime(y),c2++); ); if(c1==c2,print1(prime(x)",")) ) } \\ Cino Hilliard, Jan 25 2005

forprime(p=1,999, p-precprime(n-1)==nextprime(p+1)-p && print1(p",")) \\ M. F. Hasler, Jun 01 2013

is(n)=n-precprime(n-1)==nextprime(n+1)-n && isprime(n) \\ Charles R Greathouse IV, Apr 07 2016

from sympy import nextprime; p, q, r = 2, 3, 5
while q < 6000:
    if 2*q == p + r: print(q, end = ", ")
    p, q, r = q, r, nextprime(r) # Ya-Ping Lu, Dec 23 2021

2*p_n = p_(n-1) + p_(n+1).
Equals { p = prime(k) | A118534(k) = prime(k-1) }. - Rémi Eismann, Nov 30 2009
a(n) = A000040(A064113(n) + 1) = (A122535(n) + A181424(n)) / 2. - Reinhard Zumkeller, Jan 20 2012
a(n) = A122535(n) + A117217(n). - Zak Seidov, Feb 14 2013
Equals A145025 intersect A000040 = A145025 \ A024675. - M. F. Hasler, Jun 01 2013
Conjecture: Limit_{n->oo} n*(log(a(n)))^2 / a(n) = 1/2. - Alain Rocchelli, Mar 21 2024
Conjecture: The asymptotic limit of the average of a(n+1)-a(n) is equivalent to 2*(log(a(n)))^2. Otherwise formulated: 2 * Sum_{n=1..N} (log(a(n)))^2 ~ a(N). - Alain Rocchelli, Mar 23 2024

Reworded comment and added formula from R. Eismann. - M. F. Hasler, Nov 30 2009

Edited by Daniel Forgues, Jan 15 2011

A118534 a(n) is the largest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists.

Original entry on oeis.org

0, 0, 3, 0, 9, 9, 15, 15, 17, 27, 25, 33, 39, 39, 41, 47, 57, 55, 63, 69, 67, 75, 77, 81, 93, 99, 99, 105, 105, 99, 123, 125, 135, 129, 147, 145, 151, 159, 161, 167, 177, 171, 189, 189, 195, 187, 199, 219, 225, 225, 227, 237, 231, 245, 251, 257, 267, 265, 273, 279

Offset: 1

Rémi Eismann, Apr 18 2006, Feb 14 2008

a(n) = prime(n) - g(n) or A000040(n) - A001223(n) if prime(n) - g(n) > g(n), 0 otherwise.
a(n) = 0 only for primes 2, 3 and 7.
Under the twin prime conjecture prime(n+1)-prime(n) = 2 infinitely often, and from that we can conclude that k=prime(n)-2 infinitely often. [Roderick MacPhee, Jul 24 2012]
a(n) = A062234(n) for 5 <= n <= 1000. - Georg Fischer, Oct 28 2018

			n=5: prime(5) = 11, prime(6) = 13, 13 = 11 + (11 mod 3) = 11 + (11 mod 9), so A117078(5) = 3, a(5) = 9 and A117563(5) = 9/3 = 3. Thus 11 has level 3 and so is a member of A117873.

Remi Eismann, Table of n, a(n) for n = 1..10000

Cf. A062234, A117078; essentially the same as A117563.

a[n_] := If[n == 1 || n == 2 || n == 4, 0, 2Prime[n] - Prime[n + 1]]; Array[a, 62] (* Robert G. Wilson v, May 09 2006 *)

Edited by N. J. A. Sloane, May 07 2006

More terms from Robert G. Wilson v, May 09 2006

A117876 Primes p=prime(k) of level (1,2), i.e., such that A118534(k) = prime(k-2).

Original entry on oeis.org

23, 47, 73, 233, 353, 647, 1097, 1283, 1433, 1453, 1493, 1613, 1709, 1889, 2099, 2161, 2383, 2621, 2693, 2713, 3049, 3533, 3559, 3923, 4007, 4133, 4643, 4793, 4937, 5443, 5743, 6101, 7213, 7309, 7351, 7561, 7621, 7829, 8179, 8237, 8719, 8849, 9109, 9343, 9467

Offset: 1

Rémi Eismann, May 02 2006

nonn

If prime(k) has level 1 in A117563, and if 2*prime(k) - prime(k+1) = prime(k-i), then we say that prime(k) has level (1,i). Sequence gives primes of level (1,2).

The prime p(4)=7 cannot be decomposed into weight*level+gap (<=> A117563(4)=0 <=> A118534(4)=0 <=> A117078(4)=0). For all other primes, an equivalent definition would be: Primes p(k) such that 2*p(k) - p(k+1) = p(k-2). - Rémi Eismann and M. F. Hasler, Nov 08 2009

			29 = 2*23 - 17, 2179 = 2*2161 - 2143, 5749 = 2*5743 - 5737.

Remi Eismann, Table of n, a(n) for n = 1..10000

Cf. A000040, A066495, A117078, A117563, A118534.

With[{m = 2}, Prime@ Select[Range[m + 1, 1200], If[MemberQ[{1, 2, 4}, #], 0, 2 Prime[#] - Prime[# + 1]] == Prime[# - m] &]] (* Michael De Vlieger, Jul 16 2017 *)

for(n=5,9999, 2*prime(n)-prime(n+1) == prime(n-2) & print1(prime(n),",")) \\ M. F. Hasler, Nov 08 2009

is_A117876(p)={ isprime(p) & isprime(d=2*p-nextprime(p+2)) & d == precprime(precprime(p-2)-2) & p>7 } \\ M. F. Hasler, Nov 08 2009

(define (A117876 n) (A000040 (A066495 (+ 1 n)))) ;; Antti Karttunen, Nov 30 2013

a(n) = A000040(A066495(n+1)). - Antti Karttunen, Nov 30 2013

Edited by N. J. A. Sloane, May 14 2006
More terms from Rémi Eismann, May 25 2006
Definition corrected and terms double-checked by M. F. Hasler, Nov 08 2009

A074822 Primes p such that p + 4 is prime and p == 9 (mod 10).

Original entry on oeis.org

19, 79, 109, 229, 349, 379, 439, 499, 739, 769, 859, 1009, 1279, 1429, 1489, 1549, 1579, 1609, 1999, 2239, 2269, 2389, 2539, 2659, 2689, 2749, 3019, 3079, 3319, 3529, 3919, 4129, 4519, 4639, 4729, 4789, 4969, 4999, 5479, 5569, 5689, 5779, 5839, 6199

Offset: 1

Roger L. Bagula, Sep 30 2002

From Rémi Eismann, May 14 2006; May 04 2007: (Start)
Also primes for which k is equal to 5 in A117078. Examples: prime(9) = prime(8) + (prime(8) mod 5) = 19 + (19 mod 5)=23; prime(23) = prime(22) + (prime(22) mod 5) = 79 + (79 mod 5)=83; prime(1359) = prime(1358) + (prime(1358) mod 5) = 11239+ (11239 mod 5)=11243.
The prime numbers in this sequence are of the form (10i-1) with i=(level(n)+1)/2, level(n) defined in A117563.
Consider A117078: a(n) = smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists. Sequence gives values of prime(n) for which k=5. (End)
p is the lesser member of cousin primes (p,p+4) such that p == 9 (mod 10). - Muniru A Asiru, Jul 03 2017

Remi Eismann, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Cousin Primes

Cf. A001223, A117078, A117563.

Intersection of A023200 and A030433.

Prime[ Select[ Range[1000], Prime[ # ] + 4 == Prime[ # + 1] && Mod[ Prime[ # ], 10] == 9 & ]]
Transpose[Select[Partition[Prime[Range[820]],2,1],Last[#]-First[#] == 4 && Mod[ First[ #],10]==9&]][[1]] (* Harvey P. Dale, Oct 20 2011 *)

is(n)=n%30==19 && isprime(n+4) && isprime(n) \\ Charles R Greathouse IV, Jul 12 2017

list(lim)=my(v=List(),p=19); forprime(q=23,lim+4, if(q-p==4 && p%30==19, listput(v,p)); p=q); Vec(v) \\ Charles R Greathouse IV, Jul 12 2017

Edited by Robert G. Wilson v and N. J. A. Sloane, Oct 03 2002

Entry revised by N. J. A. Sloane, Feb 24 2007

cp's OEIS Frontend

A118741 Primes for which the weight as defined in A117078 is 7.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A119593 Primes for which the weight as defined in A117078 is 7 and the gap as defined in A001223 is 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A119594 Primes for which the weight as defined in A117078 is 9 and the gap as defined in A001223 is 4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A121155 Primes for which A117078(n) is equal to A117563(n) and A117563(n) is different from 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A001223 Prime gaps: differences between consecutive primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

Extensions

A001359 Lesser of twin primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A006562 Balanced primes (of order one): primes which are the average of the previous prime and the following prime.

Views

Author

Keywords

Comments