A202361 -id:A202361 - cp's OEIS frontend

A202362 Initial prime in prime decuplets (p+0,2,6,12,14,20,24,26,30,32) preceding the maximal gaps in A202361.

9853497737, 22741837817, 242360943257, 1418575498577, 4396774576277, 8639103445097, 11105292314087, 12728490626207, 119057768524127, 226608256438997, 581653272077387, 896217252921227, 987041423819807, 1408999953009347, 1419018243046487, 2189095026865907

Offset: 1

Alexei Kourbatov, Dec 18 2011

nonn

Prime decuplets (p+0,2,6,12,14,20,24,26,30,32) are one of the two types of densest permissible constellations of 10 primes. Maximal gaps between decuplets of this type are listed in A202361; see more comments there.

			The gap of 12102794130 between the very first decuplets starting at p=9853497737 and p=21956291867 means that the initial term is a(1)=9853497737.
The next gap after the decuplet starting at p=21956291867 is smaller, so it does not contribute to this sequence.
The next gap of 141702673770 between the decuplets at p=22741837817 and p=164444511587 is a new record; therefore the next term is a(2)=22741837817.

Norman Luhn, Table of n, a(n) for n = 1..44 (terms 1..27 from Dana Jacobsen).
Tony Forbes and Norman Luhn, Prime k-tuplets
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 Math. 44, 1-70, 1923.
Alexei Kourbatov, Maximal gaps between prime k-tuples
Eric Weisstein's World of Mathematics, k-Tuple Conjecture

Cf. A027570 (prime decuplets p+0,2,6,12,14,20,24,26,30,32), A202281, A202282, A202361.

use ntheory ":all"; my($i,$l,$max)=(-1,0,0); for (sieve_prime_cluster(1,1e13,2,6,12,14,20,24,26,30,32)) { my $gap=$-$l; if ($gap>$max) { say "$i $l" if ++$i > 0; $max=$gap; } $l=$; } # Dana Jacobsen, Oct 09 2015

A027570 Initial members of prime decaplets (p, p+2, p+6, p+12, p+14, p+20, p+24, p+26, p+30, p+32).

Original entry on oeis.org

9853497737, 21956291867, 22741837817, 164444511587, 179590045487, 217999764107, 231255798857, 242360943257, 666413245007, 696391309697, 867132039857, 974275568237, 976136848847, 1002263588297, 1086344116367

Offset: 1

Warut Roonguthai

nonn

All terms are congruent to 167 (modulo 210). - Matt C. Anderson, May 29 2015

Matt C. Anderson and Dana Jacobsen, Table of n, a(n) for n = 1..10000 [first 100 terms from Matt C. Anderson]
Tony Forbes and Norman Luhn, Prime k-tuplets
Norman Luhn, 1 million terms of A027570, zip compressed (7.94 MB) (2021).

Cf. A027569, A202361, A202362.

a := 1:
for b to 25 do
a := a*ithprime(b):
end do:
a;
# now 'a' is the product of the primes less than 100.
composite_small := proc (n::integer)
description "procedure to determine if n has a prime factor less than 100";
if igcd(2305567963945518424753102147331756070, n) = 1 then return false
else return true;
end if;
end proc:
# so composite_small tests if there are any factors 2 through 97.
#begin initialization section
p := [0, 2, 6, 12, 14, 20, 24, 26, 30, 32];
o := [7517, 10247, 12137, 14447, 14867, 17177, 21377, 24107, 25997, 28727];
m := 30030;
#end initialization section
# implement isprime(m*n+o+p)
with(ArrayTools):
os:=Size(o,2):
ps:=Size(p,2):
#here ps is 10 so a prime constellation of length 10.
loopstop := 10^11:
loopstart := 0:
for n from loopstart to loopstop do
for a to os do
counter := 0; wc := 0; wd := 0;
  while `and`(wd > -10, wd < ps) do
  wd := wd+1;
  if composite_small(m*n+o[a]+p[wd]) = false then wd := wd+1
  else wd := -10 end if;
  end do;
if wd >= 9 then
while `and`(counter >= 0, wc < ps) do
  wc := wc+1;
  if isprime(m*n+o[a]+p[wc]) then counter := counter+1;
  else counter := -1
  end if;
end do;
end if;
if counter = ps then print(m*n+o[a]) end if;
end do:
end do:
# Matt C. Anderson, Apr 15 2015

use ntheory ":all"; say for sieve_prime_cluster(1,1e13, 2,6,12,14,20,24,26,30,32); # Dana Jacobsen, Sep 30 2015

A200503 Record (maximal) gaps between prime sextuplets (p, p+4, p+6, p+10, p+12, p+16).

Original entry on oeis.org

90, 15960, 24360, 1047480, 2605680, 2856000, 3605070, 4438560, 5268900, 17958150, 21955290, 23910600, 37284660, 40198200, 62438460, 64094520, 66134250, 70590030, 77649390, 83360970, 90070470, 93143820, 98228130, 117164040, 131312160, 151078830, 154904820

Offset: 1

Alexei Kourbatov, Nov 18 2011

Prime sextuplets (p, p+4, p+6, p+10, p+12, p+16) are densest permissible constellations of 6 primes. Average gaps between sextuplets (and, more generally, between prime k-tuples) can be deduced from the Hardy-Littlewood k-tuple conjecture and are O(log^6(p)). Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps are O(log^7(p)).

A200504 lists initial primes in sextuplets preceding the maximal gaps. A233426 lists the corresponding primes at the end of the maximal gaps.

			The gap of 15960 between sextuplets with initial primes 97 and 16057 is a maximal gap - larger than any preceding gap; therefore a(2)=15960.

Martin Raab, Table of n, a(n) for n = 1..83 (terms 1..56 from Alexei Kourbatov, terms 57..71 from Norman Luhn).
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.
Alexei Kourbatov, Maximal gaps between prime k-tuples
Alexei Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Norman Luhn, Patterns of prime k-tuplets & the Hardy-Littlewood constants.
Norman Luhn, Record Gaps Between Prime Sextuplets.
Eric Weisstein's World of Mathematics, k-Tuple Conjecture

Cf. A022008 (prime sextuplets), A113274, A113404, A200504, A201596, A201598, A201062, A201073, A201051, A201251, A202281, A202361, A008407, A002386, A233426.

DeleteDuplicates[Differences[Select[Partition[Prime[Range[10^7]],6,1],Differences[#]=={4,2,4,2,4}&][[;;,1]]],GreaterEqual] (* The program generates the first 10 terms of the sequence. *) (* Harvey P. Dale, May 08 2025 *)

(1) Conjectured upper bound: gaps between prime sextuplets (p, p+4, p+6, p+10, p+12, p+16) are smaller than 0.058*(log p)^7, where p is the prime at the end of the gap.
(2) Estimate for the actual size of the maximal gap that ends at p: maximal gap = a(log(p/a)-1/3), where a = 0.058*(log p)^6 is the average gap between sextuplets near p, as predicted by the Hardy-Littlewood k-tuple conjecture.
Formulas (1) and (2) are asymptotically equal as p tends to infinity. However, (1) yields values greater than all known gaps, while (2) yields "good guesses" that may be either above or below the actual size of maximal gaps. Both formulas (1) and (2) are derived from the Hardy-Littlewood k-tuple conjecture via probability-based heuristics relating the expected maximal gap size to the average gap. Neither of the formulas has a rigorous proof (the k-tuple conjecture itself has no formal proof either). In both formulas, the constant ~0.058 is reciprocal to the Hardy-Littlewood 6-tuple constant 17.2986...

A202281 Record (maximal) gaps between prime decuplets (p+0,2,6,8,12,18,20,26,30,32).

Original entry on oeis.org

33081664140, 50040961320, 211797665730, 278538937950, 314694286830, 446820068310, 589320949140, 1135263664920, 1154348695500, 1280949740070, 1340804150070, 1458168320490, 1539906870810, 1858581264540, 2590180927950, 3182865274050, 4949076176310, 5719502339670

Offset: 1

Alexei Kourbatov, Dec 15 2011

nonn

Prime decuplets (p+0,2,6,8,12,18,20,26,30,32) are one of the two types of densest permissible constellations of 10 primes (A027569 and A027570).
Average gaps between prime k-tuples are O(log^k(p)), with k=10 for decuplets, by the Hardy-Littlewood k-tuple conjecture. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps are O(log^11(p)).
A202282 lists initial primes in decuplets (p+0,2,6,8,12,18,20,26,30,32) preceding the maximal gaps.

			The gap of 33081664140 after the first decuplet starting at p=11 is the term a(1). The next three gaps of 50040961320, 211797665730, 278538937950 form an increasing sequence, each setting a new record; therefore each of these gaps is in the sequence, as a(2), a(3), a(4). The next gap is not a record, so it is not in this sequence.

Norman Luhn, Table of n, a(n) for n = 1..54 (terms 1..32 from Dana Jacobsen).
Tony Forbes and Norman Luhn, Prime k-tuplets
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 Math. 44, 1-70, 1923.
Alexei Kourbatov, Maximal gaps between prime k-tuples
Alexei Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
Alexei Kourbatov, Tables of record gaps between prime constellations, arXiv preprint arXiv:1309.4053 [math.NT], 2013.
Eric Weisstein's World of Mathematics, k-Tuple Conjecture

Cf. A027569 (prime decuplets p+0,2,6,8,12,18,20,26,30,32), A202282, A202361, A113274, A113404, A200503, A201596, A201598, A201062, A201073, A201051, A201251

use ntheory ":all"; my($i,$l,$max)=(-1,0,0); for (sieve_prime_cluster(1,1e13,2,6,8,12,18,20,26,30,32)) { my $gap=$-$l; if ($gap>$max) { say "$i $gap" if ++$i > 0; $max=$gap; } $l=$; } # Dana Jacobsen, Oct 08 2015

(1) Upper bound: gaps between prime decuplets (p+0,2,6,8,12,18,20,26,30,32) are smaller than 0.00059*(log p)^11, where p is the prime at the end of the gap.
(2) Estimate for the actual size of maximal gaps near p: max gap = a(log(p/a)-0.2), where a = 0.00059(log p)^10 is the average gap between 10-tuples near p.
Both formulas (1) and (2) are derived from the Hardy-Littlewood k-tuple conjecture via probability-based heuristics relating the expected maximal gap size to the average gap. Neither of the formulas has a rigorous proof.

A201051 Record (maximal) gaps between prime septuplets (p, p+2, p+6, p+8, p+12, p+18, p+20).

Original entry on oeis.org

165690, 903000, 10831800, 13773480, 22813770, 31090080, 43751820, 60881310, 86746170, 118516860, 239951250, 281573040, 359932650, 384903750, 518385000, 902801550, 1027007520, 1086331680, 1329198570, 2176467090

Offset: 1

Alexei Kourbatov, Nov 28 2011

Prime septuplets (p, p+2, p+6, p+8, p+12, p+18, p+20) are one of the two types of densest permissible constellations of 7 primes (A022009 and A022010). Average gaps between prime k-tuples can be deduced from the Hardy-Littlewood k-tuple conjecture and are O(log^k(p)), with k=7 for septuplets. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps are O(log^8(p)).

A201249 lists initial primes p in septuplets (p, p+2, p+6, p+8, p+12, p+18, p+20) preceding the maximal gaps. A233425 lists the corresponding primes at the end of the maximal gaps.

			The gap of 165690 between septuplets starting at p=11 and p=165701 is the very first gap, so a(1)=165690. The gap of 903000 between septuplets starting at p=165701 and p=1068701 is a maximal gap - larger than any preceding gap; therefore a(2)=903000. The next gap of 10831800 is again a maximal gap, so a(3)=10831800. The next gap is smaller, so it does not contribute to the sequence.

Alexei Kourbatov, Table of n, a(n) for n = 1..36
Tony Forbes and Norman Luhn, Prime k-tuplets
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 Math., Vol. 44, No. 1 (1923), pp. 1-70.
Alexei Kourbatov, Maximal gaps between prime k-tuples
Alexei Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Norman Luhn, Record Gaps Between Prime Septuplets, up to 10^17
Eric Weisstein's World of Mathematics, k-Tuple Conjecture

Cf. A022009 (prime septuplets p, p+2, p+6, p+8, p+12, p+18, p+20), A113274, A113404, A200503, A201062, A201073, A201596, A201598, A201251, A202281, A202361, A201249, A002386, A233425.

Gaps between prime septuplets (p, p+2, p+6, p+8, p+12, p+18, p+20) are smaller than 0.02*(log p)^8, where p is the prime at the end of the gap. There is no rigorous proof of this formula. The O(log^8(p)) growth rate is suggested by numerical data and heuristics based on probability considerations.

A201062 Record (maximal) gaps between prime 5-tuples (p, p+4, p+6, p+10, p+12).

Original entry on oeis.org

90, 1770, 2190, 10080, 24360, 35910, 156750, 208620, 304920, 306390, 328020, 422190, 526350, 639330, 706860, 866460, 1030770, 1111620, 1147440, 1151100, 1447530, 1769670, 1793070, 2024610, 2320170, 2335080, 2403570

Offset: 1

Alexei Kourbatov, Nov 26 2011

nonn

Prime quintuplets (p, p+4, p+6, p+10, p+12) are one of the two types of densest permissible constellations of 5 primes (A022006 and A022007). Average gaps between prime k-tuples can be deduced from the Hardy-Littlewood k-tuple conjecture and are O(log^k(p)), with k=5 for quintuplets. If a gap is larger than all preceding gaps, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps between quintuplets are O(log^6(p)).

A201063 lists initial primes in quintuplets (p, p+4, p+6, p+10, p+12) preceding the maximal gaps. A233433 lists the corresponding primes at the end of the maximal gaps.

			The gap of 90 between quintuplets starting at p=7 and p=97 is the very first gap, so a(1)=90. The gap of 1770 between quintuplets starting at p=97 and p=1867 is a maximal gap - larger than any preceding gap; therefore a(2)=1770. The gap after p=1867 is smaller, so a new term is not added.

Alexei Kourbatov, Table of n, a(n) for n = 1..71
Tony Forbes, Prime k-tuplets
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.
Alexei Kourbatov, Maximal gaps between prime 5-tuples (graphs/data up to 10^15)
A. Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Eric W. Weisstein, k-Tuple Conjecture

Cf. A022007 (prime 5-tuples p, p+4, p+6, p+10, p+12), A113274, A113404, A200503, A201596, A201598, A201073, A201051, A201251, A202281, A202361, A201063, A002386, A233433.

DeleteDuplicates[Differences[Select[Partition[Prime[Range[10^7]],5,1],Differences[#]=={4,2,4,2}&][[;;,1]]],GreaterEqual] (* The program generates the first 18 terms of the sequence. *) (* Harvey P. Dale, Apr 20 2025 *)

(1) Upper bound: gaps between prime 5-tuples are smaller than 0.0987*(log p)^6, where p is the prime at the end of the gap.
(2) Estimate for the actual size of the maximal gap that ends at p: maximal gap ~ a(log(p/a)-0.4), where a = 0.0987*(log p)^5 is the average gap between quintuplets near p, as predicted by the Hardy-Littlewood k-tuple conjecture.
Formulas (1) and (2) are asymptotically equal as p tends to infinity. However, (1) yields values greater than all known gaps, while (2) yields "good guesses" that may be either above or below the actual size of known maximal gaps.
Both formulas (1) and (2) are derived from the Hardy-Littlewood k-tuple conjecture via probability-based heuristics relating the expected maximal gap size to the average gap. Neither of the formulas has a rigorous proof (the k-tuple conjecture itself has no formal proof either). In both formulas, the constant ~0.0987 is reciprocal to the Hardy-Littlewood 5-tuple constant 10.1317...

A201073 Record (maximal) gaps between prime 5-tuples (p, p+2, p+6, p+8, p+12).

Original entry on oeis.org

6, 90, 1380, 14580, 21510, 88830, 97020, 107100, 112140, 301890, 401820, 577710, 689850, 846210, 857010, 986160, 1655130, 2035740, 2266320, 2467290, 2614710, 3305310, 3530220, 3880050, 3885420, 5290440, 5713800, 6049890

Offset: 1

Alexei Kourbatov, Nov 26 2011

nonn

Prime quintuplets (p, p+2, p+6, p+8, p+12) are one of the two types of densest permissible constellations of 5 primes (A022006 and A022007). Average gaps between prime k-tuples can be deduced from the Hardy-Littlewood k-tuple conjecture and are O(log^k(p)), with k=5 for quintuplets. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps are O(log^6(p)).

A201074 lists initial primes in quintuplets (p, p+2, p+6, p+8, p+12) preceding the maximal gaps. A233432 lists the corresponding primes at the end of the maximal gaps.

			The initial four gaps of 6, 90, 1380, 14580 (between quintuplets starting at p=5, 11, 101, 1481, 16061) form an increasing sequence of records. Therefore a(1)=6, a(2)=90, a(3)=1380, and a(4)=14580. The next gap (after 16061) is smaller, so a new term is not added.

Alexei Kourbatov, Table of n, a(n) for n = 1..64
Tony Forbes, Prime k-tuplets
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.
Alexei Kourbatov, Maximal gaps between prime 5-tuples (graphs/data up to 10^15)
A. Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242, 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Eric W. Weisstein, k-Tuple Conjecture

Cf. A022006 (prime 5-tuples p, p+2, p+6, p+8, p+12), A113274, A113404, A200503, A201596, A201598, A201051, A201251, A202281, A202361, A201062, A201074, A002386, A233432.

(1) Upper bound: gaps between prime 5-tuples are smaller than 0.0987*(log p)^6, where p is the prime at the end of the gap.
(2) Estimate for the actual size of the maximal gap that ends at p: maximal gap ~ a(log(p/a)-0.4), where a = 0.0987*(log p)^5 is the average gap between quintuplets near p, as predicted by the Hardy-Littlewood k-tuple conjecture.
Formulas (1) and (2) are asymptotically equal as p tends to infinity. However, (1) yields values greater than all known gaps, while (2) yields "good guesses" that may be either above or below the actual size of known maximal gaps.
Both formulas (1) and (2) are derived from the Hardy-Littlewood k-tuple conjecture via probability-based heuristics relating the expected maximal gap size to the average gap. Neither of the formulas has a rigorous proof (the k-tuple conjecture itself has no formal proof either). In both formulas, the constant ~0.0987 is reciprocal to the Hardy-Littlewood 5-tuple constant 10.1317...

A201251 Record (maximal) gaps between prime septuplets (p, p+2, p+8, p+12, p+14, p+18, p+20).

Original entry on oeis.org

83160, 195930, 341880, 5414220, 9270030, 18980220, 25622520, 36077370, 51597630, 92184750, 125523090, 140407470, 141896370, 336026460, 403369470, 435390270, 442452570, 627852330, 754383210, 1008582120, 1021464990, 1073692620, 1088148810, 1145336850

Offset: 1

Alexei Kourbatov, Nov 28 2011

Prime septuplets (p, p+2, p+8, p+12, p+14, p+18, p+20) are one of the two types of densest permissible constellations of 7 primes (A022009 and A022010). Average gaps between prime k-tuples can be deduced from the Hardy-Littlewood k-tuple conjecture and are O(log^k(p)), with k=7 for septuplets. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps are O(log^8(p)).

A201252 lists initial primes in septuplets (p, p+2, p+8, p+12, p+14, p+18, p+20) preceding the maximal gaps. A233038 lists the corresponding primes at the end of the maximal gaps.

			The gap of 83160 between septuplets starting at p=5639 and p=88799 is the very first gap, so a(1)=83160. The gap of 195930 between septuplets starting at p=88799 and p=284729 is a maximal gap - larger than any preceding gap; therefore a(2)=195930. The next gap of 341880 is again a maximal gap, so a(3)=341880. The next gap is smaller, so it does not contribute to the sequence.

Alexei Kourbatov, Table of n, a(n) for n = 1..52
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 Math., Vol. 44, No. 1 (1923), pp. 1-70.
Alexei Kourbatov, Maximal gaps between prime k-tuples.
Alexei Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2.
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.
Norman Luhn, Patterns of prime k-tuplets & the Hardy-Littlewood constants.
Norman Luhn, Record Gaps Between Prime Septuplets, up to 10^17.
Eric Weisstein's World of Mathematics, k-Tuple Conjecture.

Cf. A022010 (prime septuplets p, p+2, p+8, p+12, p+14, p+18, p+20), A113274, A113404, A200503, A201062, A201073, A201596, A201598, A202281, A202361, A201051, A002386, A233038.

Gaps between prime septuplets (p, p+2, p+8, p+12, p+14, p+18, p+20) are smaller than 0.02*(log p)^8, where p is the prime at the end of the gap. There is no rigorous proof of this formula. The O(log^8(p)) growth rate is suggested by numerical data and heuristics based on probability considerations.

A201596 Record (maximal) gaps between prime triples (p, p+4, p+6).

Original entry on oeis.org

6, 24, 30, 90, 150, 156, 210, 240, 306, 366, 384, 444, 810, 834, 1086, 1200, 1326, 2316, 3876, 4230, 4350, 8244, 8880, 9450, 10686, 10950, 11784, 12816, 13554, 15504, 15576, 16254, 16506, 16596, 19446, 19944, 21516, 38340, 39990, 41556, 45786, 47190, 48246, 59856

Offset: 1

Alexei Kourbatov, Dec 03 2011

nonn

Prime triples (p, p+4, p+6) are one of the two types of densest permissible constellations of 3 primes (A022004 and A022005). By the Hardy-Littlewood k-tuple conjecture, average gaps between prime k-tuples are O(log^k(p)), with k=3 for triples. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps between triples are O(log^4(p)).

A201597 lists initial primes p in triples (p, p+4, p+6) preceding the maximal gaps. A233435 lists the corresponding primes p at the end of the maximal gaps.

			The gap of 6 between triples starting at p=7 and p=13 is the very first gap, so a(1)=6. The gap of 24 between triples starting at p=13 and p=37 is a maximal gap - larger than any preceding gap; therefore a(2)=24. The gap of 30 between triples at p=37 and p=67 is again a maximal gap, so a(3)=30. The next gap is smaller, so it does not contribute to the sequence.

Alexei Kourbatov, Table of n, a(n) for n = 1..79
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.
Alexei Kourbatov, Maximal gaps between prime k-tuples
A. Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Norman Luhn, Record Gaps Between Prime Triplets.
Eric W. Weisstein, k-Tuple Conjecture

Cf. A022005 (prime triples p, p+4, p+6), A113274, A113404, A200503, A201598, A201062, A201073, A201051, A201251, A202281, A202361, A201597, A233435.

DeleteDuplicates[Differences[Select[Partition[Prime[Range[5*10^6]],3,1],Differences[#]=={4,2}&][[;;,1]]],GreaterEqual]  (* Harvey P. Dale, Feb 26 2023 *)

Gaps between prime triples (p, p+4, p+6) are smaller than 0.35*(log p)^4, where p is the prime at the end of the gap. There is no rigorous proof of this formula. The O(log^4(p)) growth rate is suggested by numerical data and heuristics based on probability considerations.

A201598 Record (maximal) gaps between prime triples (p, p+2, p+6).

Original entry on oeis.org

6, 24, 60, 84, 114, 180, 210, 264, 390, 564, 630, 1050, 1200, 1530, 2016, 2844, 3426, 3756, 3864, 3936, 4074, 4110, 6090, 8250, 9240, 9270, 10344, 10506, 10734, 10920, 12930, 15204, 20190, 20286, 21216, 25746, 34920, 38820, 39390, 41754, 43020, 44310, 52500, 71346

Offset: 1

Alexei Kourbatov, Dec 03 2011

nonn

Prime triples (p, p+2, p+6) are one of the two types of densest permissible constellations of 3 primes (A022004 and A022005). By the Hardy-Littlewood k-tuple conjecture, average gaps between prime k-tuples are O(log^k(p)), with k=3 for triples. If a gap is larger than any preceding gap, we call it a maximal gap, or a record gap. Maximal gaps may be significantly larger than average gaps; this sequence suggests that maximal gaps between triples are O(log^4(p)).

A201599 lists initial primes p in triples (p, p+2, p+6) preceding the maximal gaps. A233434 lists the corresponding primes p at the end of the maximal gaps.

			The gap of 6 between triples starting at p=5 and p=11 is the very first gap, so a(1)=6. The gap of 6 between triples starting at p=11 and p=17 is not a record, so it does not contribute to the sequence. The gap of 24 between triples starting at p=17 and p=41 is a maximal gap - larger than any preceding gap; therefore a(2)=24.

Alexei Kourbatov, Table of n, a(n) for n = 1..72
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.
Alexei Kourbatov, Maximal gaps between prime k-tuples
A. Kourbatov, Maximal gaps between prime k-tuples: a statistical approach, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and J. Int. Seq. 16 (2013) #13.5.2
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.
Alexei Kourbatov and Marek Wolf, Predicting maximal gaps in sets of primes, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
Norman Luhn, Record Gaps Between Prime Triplets.
Eric Weisstein's World of Mathematics, k-Tuple Conjecture.

Cf. A022004 (prime triples p, p+2, p+6), A113274, A113404, A200503, A201596, A201062, A201073, A201051, A201251, A202281, A202361, A201599, A233434.

Gaps between prime triples (p, p+2, p+6) are smaller than 0.35*(log p)^4, where p is the prime at the end of the gap. There is no rigorous proof of this formula. The O(log^4(p)) growth rate is suggested by numerical data and heuristics based on probability considerations.

cp's OEIS Frontend

A202362 Initial prime in prime decuplets (p+0,2,6,12,14,20,24,26,30,32) preceding the maximal gaps in A202361.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Perl

A027570 Initial members of prime decaplets (p, p+2, p+6, p+12, p+14, p+20, p+24, p+26, p+30, p+32).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Perl

A200503 Record (maximal) gaps between prime sextuplets (p, p+4, p+6, p+10, p+12, p+16).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A202281 Record (maximal) gaps between prime decuplets (p+0,2,6,8,12,18,20,26,30,32).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Perl

Formula

A201051 Record (maximal) gaps between prime septuplets (p, p+2, p+6, p+8, p+12, p+18, p+20).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A201062 Record (maximal) gaps between prime 5-tuples (p, p+4, p+6, p+10, p+12).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A201073 Record (maximal) gaps between prime 5-tuples (p, p+2, p+6, p+8, p+12).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A201251 Record (maximal) gaps between prime septuplets (p, p+2, p+8, p+12, p+14, p+18, p+20).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs