A083409 -id:A083409 - cp's OEIS frontend

A332493 The minimal Skewes number for prime n-tuplets, choosing the n-tuplet with latest occurrence of the first sign change relative to the Hardy-Littlewood prediction when more than one type of n-tuplets exists (A083409(n)>1) for the given n.

1369391, 87613571, 1172531, 216646267, 251331775687, 214159878489239, 750247439134737983

Offset: 2

Alexei Kourbatov and Hugo Pfoertner, May 11 2020

a(n) >= A210439(n). Equals A210439(n) at n=2,4,6, i.e., at those n for which there is only one type of prime n-tuplets (admissible prime n-tuples of minimal span). The corresponding minimal span (diameter) is given by A008407(n).
See A210439 for more information, references and links.
From Hugo Pfoertner, Oct 21 2021: (Start)
There are two options for choosing a(8):
Either one interprets "latest occurrence" as the largest number of 8-tuplets before the Hardy-Littlewood (H-L) prediction is exceeded, or one selects the larger value of the first 8-tuplet term causing the first crossing.
In the first case, 40634356 8-tuplets of the type p + [0, 2, 6, 12, 14, 20, 24, 26] are required before the H-L prediction is exceeded with an 8-tuplet 523250002674163757 + [0, 2, 6, ...].
In the second case, 20316822 8-tuplets of type p + [0, 6, 8, 14, 18, 20, 24, 26] are needed to reach the first crossing of the H-L prediction. The corresponding 8-tuplet has 750247439134737983 as first term.
The interchanging is a consequence of the different H-L constants for the two tuplet types, 475.36521.. vs. 178.261954.., which have a ratio of 8/3 to one another.
Since the H-L constant for the "earliest occurrence" A210439(8) is 178.26.., this speaks in favor of a choice from the two possibilities, which uses the same H-L constant, i.e., the occurrence with the larger tuplet start and not the occurrence with the larger number of required tuplets, for which a separate sequence A348053 is created. (End)

			Denote by pi_n(x) the n-tuplet counting function, C_n the corresponding Hardy-Littlewood constant, and Li_n(x) the integral from 2 to x of (1/(log t)^n) dt.
For 7-tuples with pattern (0 2 8 12 14 18 20) we have the Skewes number p=214159878489239; this is the initial prime p in the 7-tuple where for the first time we have pi_7(p) > C_7 Li_7(p). For the other dense pattern (0 2 6 8 12 18 20), the first sign change of pi_7(x) - C_7 Li_7(x) occurs earlier, at 7572964186421. Therefore we have a(7)=214159878489239, while A210439(7)=7572964186421.

Tony Forbes and Norman Luhn, Prime k-tuplets
Alexei Kourbatov, Optimized PARI code for computing a(7)
Norman Luhn, Database of the smallest prime k-tuplets, compressed files.
Hugo Pfoertner, Illustration of growth of number of 7-tuples, (2020).
Hugo Pfoertner, Comparison of number of octuplets needed to achieve the H-L prediction, (2021).

Cf. A008407, A083409, A210439, A333586, A333587, A348053.

PARI
```
See A. Kourbatov link.
```

\\ The first result is A210439(5), the 2nd is a(5)
Li(x, n)=intnum(t=2, n, 1/log(t)^x);
G5=(15^4/2^11)*0.409874885088236474478781212337955277896358; \\ A269843
n1=0;n2=0;n1found=0;n2found=0;p1=5;p2=7;p3=11;p4=13;
forprime(p5=17,10^12,if(p5-p1==12,my(L=Li(5,p1));if(p2-p1==2,n1++;if(!n1found&&n1/L>G5,print(p1," ",p2," ",n1," ",n1/L);n1found=1),n2++;if(!n2found&&n2/L>G5,print(p1," ",p2," ",n2," ",n2/L);n2found=1)));if(n1found&&n2found,break);p1=p2;p2=p3;p3=p4;p4=p5) \\ Hugo Pfoertner, May 12 2020
\\ Code for a(7), similar to A. Kourbatov's code but much shorter.
\\ Run time approx. 2 days, prints every 1000th 7-tuple
G7=(35^6/(3*2^22))*0.36943751038649868932319074987675; \\ A271742
s=[0,2,8,12,14,18,20];
r=[809, 2069, 2909, 5639, 6689, 7529, 7739, 8999, 10259, 12149, 12359, 14459, 14879, 15929, 17189, 19289, 20549, 21389, 23909, 24119, 26009, 27479, 28529, 28739];
forstep(p0=0,10^15,30030,for(j=1,24,my(p1=p0+r[j],isp=1,L);for(k=1,7,my(p=p1+s[k]);if(!ispseudoprime(p),isp=0;break));if(isp,L=Li(7,p1);n++;if(n%1000==0||n/L>G7,print(p1," ",p1+s[#s]," ",n/L," ",n));if(n/L>G7,break(2))))) \\ Hugo Pfoertner, May 16 2020

a(8) from Norman Luhn and Hugo Pfoertner, Oct 21 2021

A008407 Minimal difference s(n) between beginning and end of n consecutive large primes (n-tuplet) permitted by divisibility considerations.

Original entry on oeis.org

0, 2, 6, 8, 12, 16, 20, 26, 30, 32, 36, 42, 48, 50, 56, 60, 66, 70, 76, 80, 84, 90, 94, 100, 110, 114, 120, 126, 130, 136, 140, 146, 152, 156, 158, 162, 168, 176, 182, 186, 188, 196, 200, 210, 212, 216, 226, 236, 240, 246, 252, 254, 264, 270, 272, 278

Offset: 1

T. Forbes (anthony.d.forbes(AT)googlemail.com)

Tony Forbes defines a prime k-tuplet (distinguished from a prime k-tuple) to be a maximally possible dense cluster of primes (a prime constellation) which will necessarily involve consecutive primes whereas a prime k-tuple is a prime cluster which may not necessarily be of maximum possible density (in which case the primes are not necessarily consecutive.)
a(n) >> n log log n; in particular, for any eps > 0, there is an N such that a(n) > (e^gamma - eps) n log log n for all n > N. Probably N can be chosen as 1; the actual rate of growth is larger. Can a larger growth rate be established? Perhaps a(n) ~ n log n. - Charles R Greathouse IV, Apr 19 2012
Conjecture: (i) The sequence a(n)^(1/n) (n=3,4,...) is strictly decreasing (to the limit 1). (ii) We have 0 < a(n)/n - H_n < (gamma + 2)/(log n) for all n > 4, where H_n denotes the harmonic number 1+1/2+1/3+...+1/n, and gamma refers to the Euler constant 0.5772... [The second inequality has been verified for n = 5, 6, ..., 5000.] - Zhi-Wei Sun, Jun 28 2013.
Conjecture: For any integer n > 2, there is 1 < k < n such that 2*n - a(k)- 1 and 2*n - a(k) + 1 are twin primes. Also, every n = 3, 4, ... can be written as p + a(k)/2 with p a prime and k an integer greater than one. - Zhi-Wei Sun, Jun 29-30 2013.
The number of configurations that realize this minimal diameter, is A083409(n). - Jeppe Stig Nielsen, Jul 26 2018
Engelsma points out that the values he lists past a(342)=2328 are only the "best known" values, and are not confirmed as minimal. - Brian Kehrig, Mar 21 2025

R. K. Guy, "Unsolved Problems in Number Theory", lists a number of relevant papers in Section A8.
John Leech, "Groups of primes having maximum density", Math. Tables Aids to Comput., 12 (1958) 144-145.

T. D. Noe, Table of n, a(n) for n = 1..342 (shortened to 342 terms by Brian Kehrig)
Thomas J. Engelsma, Permissible Patterns
Tony Forbes and Norman Luhn, k-tuplets
Daniel A. Goldston, Apoorva Panidapu, and Jordan Schettler, Explicit Calculations for Sono's Multidimensional Sieve of E2-Numbers, arXiv:2208.13931 [math.NT], 2022. See H(n) in Table 1 p. 2.
G. H. Hardy and J. E. Littlewood, Some problems of 'partitio numerorum'; III: on the expression of a number as a sum of primes, Acta Mathematica, Vol. 44, pp. 1-70, 1923. See final section.
Norman Luhn, Patterns of prime k-tuplets & the Hardy-Littlewood constants.
A. V. Sutherland, Narrow admissible k-tuples: bounds on H(k), 2013.
T. Tao, Bounded gaps between primes, PolyMath Wiki Project, 2013.
Eric Weisstein's World of Mathematics, Prime Constellation.

Equals A020497 - 1.

Cf. A083409.

s(k), k >= 2, is smallest s such that there exist B = {b_1, b_2, ..., b_k} with s = b_k - b_1 and such that for all primes p <= k, not all residues modulo p are represented by B.

Correction from Pat Weidhaas (weidhaas(AT)wotan.llnl.gov), Jun 15 1997
Edited by Daniel Forgues, Aug 13 2009
a(1)=0 prepended by Max Alekseyev, Aug 14 2015

A257129 Initial members of prime 11-tuples.

Original entry on oeis.org

11, 1418575498573, 2118274828903, 4396774576273, 6368171154193, 6953798916913, 7908189600581, 10527733922591, 12640876669691, 27899359258003, 28138953913303, 34460918582323, 38545620633251, 40362095929003, 42023308245613, 43564522846961, 44058461657443, 60268613366231, 60596839933361, 61062361183903, 71431649320301

Offset: 1

Tim Johannes Ohrtmann, Apr 16 2015

nonn

It appears that this lists only starting primes for one of the A083409(11) = 2 constellations with minimal diameter A008407(11) = 36, i.e., the union of A213646 and A213647, while there are other prime 11-tuples with larger diameter. - M. F. Hasler, Dec 03 2018

Tim Johannes Ohrtmann and Dana Jacobsen, Table of n, a(n) for n = 1..13723 [This replaces an earlier b-file from Tim Johannes Ohrtmann]
Tony Forbes k-tuplets

Initial members of all of the first prime k-tuples:
twin primes: A001359.
prime triples: A007529 out of A022004, A022005.
prime quadruples: A007530.
prime quintuples: A086140 out of A022007, A022006.
prime sextuples: A022008.
prime septuples: A257124 out of A022009, A022010.
prime octuples: A065706 out of A022011, A022012, A022013.
prime nonuples: A257125 out of A022547, A022548, A022545, A022546.
prime 10-tuples: A257127 out of A027569, A027570.
prime 11-tuples: this sequence out of A213646, A213647.
prime 12-tuples: A257131 out of A213601, A213645.
prime 13-tuples: A257135 out of A214947, A257137, A257138, A257139, A257140, A257141.
prime 14-tuples: A257166 out of A257167, A257168.
prime 15-tuples: A257169 out of A257304, A257305, A257306, A257307.
prime 16-tuples: A257308 out of A257369, A257370.
prime 17-tuples: A257373 out of A257374, A257375, A257376, A257377.

A031172 a(n) = prime(n+10) - prime(n).

Original entry on oeis.org

29, 34, 36, 36, 36, 40, 42, 42, 44, 42, 42, 42, 42, 46, 50, 48, 44, 46, 42, 42, 54, 52, 54, 50, 52, 50, 54, 56, 58, 60, 52, 50, 54, 54, 48, 48, 54, 60, 60, 56, 54, 58, 50, 58, 60, 64, 58, 48, 50, 52, 50, 54, 66, 60, 56, 54, 62, 66, 70, 68, 70, 66, 60, 62, 66, 66, 58

Offset: 1

Jeff Burch

In principle, moderate values should appear infinitely many times, by analogy with twin primes hypothesis. For example, a(n) = 44 for n = 9, 17, 206, 1604467, 12905293, 18008874, 26545460, 32655424, 57848470, 58313630, 59022635, 66275281, 81581956, 123780499, 160884754, 167797255, 179786560, 181569324, 239542290, ... - Zak Seidov, Sep 14 2014, edited by M. F. Hasler, Dec 03 2018

According to the k-tuple conjecture, any admissible k-tuple of primes occurs with calculable nonzero asymptotic density, i.e., in particular, infinitely many times. For k = 11, number of primes in the interval [prime(n), prime(n+10)], the smallest possible diameter of a k-tuple is A008407(11) = 36, and there are A083409(11) = 2 such constellations: {0, 4, 6, 10, 16, 18, 24, 28, 30, 34, 36}, first occurring at A213646(1) = 1418575498573, and {0, 2, 6, 8, 12, 18, 20, 26, 30, 32, 36}, first occurring at A213647(1) = 11. The combined list { prime(n) | a(n) = 36 } is A257129. - M. F. Hasler, Dec 03 2018

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

Cf. A000040.
Cf. A001223, A031131, A031165, A031166, A031167, A031168, A031169, A031170, A031171.
Cf. A008407, A083409, A213646, A213647, A257129.

P:=Filtered([1..400],IsPrime);; a:=List([1..Length(P)-10],n->P[n+10]-P[n]); # Muniru A Asiru, Dec 06 2018

a031172_list = zipWith (-) (drop 10 a000040_list) a000040_list
a031172 n = a031172_list !! (n-1)  -- Reinhard Zumkeller, Aug 23 2015

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

A031172:=n->ithprime(n+10)-ithprime(n): seq(A031172(n), n=1..50);

Table[Prime[n + 10] - Prime[n], {n, 50}] (* Wesley Ivan Hurt, Sep 14 2014 *)

A031172(n)=prime(n+10)-prime(n) \\ M. F. Hasler, Dec 03 2018

from sympy import prime
for n in range(1,100): print(prime(n+10)-prime(n)) # Stefano Spezia, Dec 06 2018

[(nth_prime(n+10) - nth_prime(n)) for n in (1..100)] # G. C. Greubel, Dec 04 2018

a(n) = A000040(n+10) - A000040(n). - Wesley Ivan Hurt, Sep 14 2014

Offset changed from 2 to 1; added a(1)=29 by Vincenzo Librandi, Apr 23 2011

A186634 Irregular triangle, read by rows, giving dense patterns of n primes.

Original entry on oeis.org

0, 2, 0, 2, 6, 0, 4, 6, 0, 2, 6, 8, 0, 2, 6, 8, 12, 0, 4, 6, 10, 12, 0, 4, 6, 10, 12, 16, 0, 2, 6, 8, 12, 18, 20, 0, 2, 8, 12, 14, 18, 20, 0, 2, 6, 8, 12, 18, 20, 26, 0, 2, 6, 12, 14, 20, 24, 26, 0, 6, 8, 14, 18, 20, 24, 26, 0, 2, 6, 8, 12, 18, 20, 26, 30, 0, 2, 6, 12, 14, 20, 24, 26, 30, 0, 4, 6, 10, 16, 18, 24, 28, 30, 0, 4, 10, 12, 18, 22, 24, 28, 30, 0, 2, 6, 8, 12, 18, 20, 26, 30, 32, 0, 2, 6, 12, 14, 20, 24, 26, 30, 32

Offset: 2

T. D. Noe, Feb 24 2011

The first pattern (0,2) is for twin primes (p,p+2). Row n contains A083409(n) patterns, each one consisting of 0 followed by n-1 terms. In each row the patterns are in lexicographic order.

These numbers (in a slightly different order) appear in Table 1 of the paper by Tony Forbes. Sequence A186702 gives the least prime starting a given pattern.

			The irregular triangle begins:
0, 2
0, 2, 6, 0, 4, 6
0, 2, 6, 8
0, 2, 6, 8, 12, 0, 4, 6, 10, 12
0, 4, 6, 10, 12, 16
0, 2, 6, 8, 12, 18, 20, 0, 2, 8, 12, 14, 18, 20

T. D. Noe, Rows n = 2..20, flattened (from Forbes)
Thomas J. Engelsma, Permissible Patterns
Tony Forbes, Prime clusters and Cunningham chains, Math. Comp. 68 (1999), 1739-1747.
Tony Forbes, Smallest Prime k-tuples
Eric Weisstein's World of Mathematics, Prime Constellation

Cf. A020497, A008407, A186702, and sequences created by these patterns: A001359, A022004, A022005, A007530, A022006, A022007, A022008, A022009, A022010, A022011, A022012, A022013, A022545, A022546, A022547, A022548, A027569, A027570.

cp's OEIS Frontend

A332493 The minimal Skewes number for prime n-tuplets, choosing the n-tuplet with latest occurrence of the first sign change relative to the Hardy-Littlewood prediction when more than one type of n-tuplets exists (A083409(n)>1) for the given n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

Extensions

A008407 Minimal difference s(n) between beginning and end of n consecutive large primes (n-tuplet) permitted by divisibility considerations.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

Extensions

A257129 Initial members of prime 11-tuples.

Views

Author

Keywords

Comments

Links

Crossrefs

A031172 a(n) = prime(n+10) - prime(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

Extensions

A186634 Irregular triangle, read by rows, giving dense patterns of n primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs