cp's OEIS Frontend

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

%I A201062 #48 Apr 20 2025 13:02:14
%S A201062 90,1770,2190,10080,24360,35910,156750,208620,304920,306390,328020,
%T A201062 422190,526350,639330,706860,866460,1030770,1111620,1147440,1151100,
%U A201062 1447530,1769670,1793070,2024610,2320170,2335080,2403570
%N A201062 Record (maximal) gaps between prime 5-tuples (p, p+4, p+6, p+10, p+12).
%C A201062 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)).
%C A201062 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.
%H A201062 Alexei Kourbatov, <a href="/A201062/b201062.txt">Table of n, a(n) for n = 1..71</a>
%H A201062 Tony Forbes, <a href="http://anthony.d.forbes.googlepages.com/ktuplets.htm">Prime k-tuplets</a>
%H A201062 G. H. Hardy and J. E. Littlewood, <a href="https://dx.doi.org/10.1007/BF02403921">Some problems of 'Partitio numerorum'; III: on the expression of a number as a sum of primes</a>, Acta Mathematica, Vol. 44, pp. 1-70, 1923.
%H A201062 Alexei Kourbatov, <a href="http://www.javascripter.net/math/primes/maximalgapsbetweenprimequintuplets.htm">Maximal gaps between prime 5-tuples</a> (graphs/data up to 10^15)
%H A201062 A. Kourbatov, <a href="http://arxiv.org/abs/1301.2242">Maximal gaps between prime k-tuples: a statistical approach</a>, arXiv preprint arXiv:1301.2242 [math.NT], 2013 and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL16/Kourbatov/kourbatov3.html">J. Int. Seq. 16 (2013) #13.5.2</a>
%H A201062 Alexei Kourbatov, <a href="http://arxiv.org/abs/1309.4053">Tables of record gaps between prime constellations</a>, arXiv preprint arXiv:1309.4053 [math.NT], 2013.
%H A201062 Alexei Kourbatov, <a href="http://arxiv.org/abs/1401.6959">The distribution of maximal prime gaps in Cramer's probabilistic model of primes</a>, arXiv preprint arXiv:1401.6959 [math.NT], 2014.
%H A201062 Alexei Kourbatov and Marek Wolf, <a href="http://arxiv.org/abs/1901.03785">Predicting maximal gaps in sets of primes</a>, arXiv preprint arXiv:1901.03785 [math.NT], 2019.
%H A201062 Eric W. Weisstein, <a href="https://mathworld.wolfram.com/k-TupleConjecture.html">k-Tuple Conjecture</a>
%F A201062 (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.
%F A201062 (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.
%F A201062 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.
%F A201062 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...
%e A201062 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.
%t A201062 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 *)
%Y A201062 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.
%K A201062 nonn
%O A201062 1,1
%A A201062 _Alexei Kourbatov_, Nov 26 2011