cp's OEIS Frontend

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

%I A200503 #62 May 08 2025 14:29:59
%S A200503 90,15960,24360,1047480,2605680,2856000,3605070,4438560,5268900,
%T A200503 17958150,21955290,23910600,37284660,40198200,62438460,64094520,
%U A200503 66134250,70590030,77649390,83360970,90070470,93143820,98228130,117164040,131312160,151078830,154904820
%N A200503 Record (maximal) gaps between prime sextuplets (p, p+4, p+6, p+10, p+12, p+16).
%C A200503 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)).
%C A200503 A200504 lists initial primes in sextuplets preceding the maximal gaps. A233426 lists the corresponding primes at the end of the maximal gaps.
%H A200503 Martin Raab, <a href="/A200503/b200503.txt">Table of n, a(n) for n = 1..83</a> (terms 1..56 from Alexei Kourbatov, terms 57..71 from Norman Luhn).
%H A200503 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 A200503 Alexei Kourbatov, <a href="http://www.javascripter.net/math/primes/maximalgapsbetweenktuples.htm#6tuples">Maximal gaps between prime k-tuples</a>
%H A200503 Alexei 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 A200503 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 A200503 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 A200503 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 A200503 Norman Luhn, <a href="https://pzktupel.de/ktpatt_hl.php">Patterns of prime k-tuplets & the Hardy-Littlewood constants</a>.
%H A200503 Norman Luhn, <a href="https://pzktupel.de/RecordGaps/GAP06.php">Record Gaps Between Prime Sextuplets</a>.
%H A200503 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-TupleConjecture.html">k-Tuple Conjecture</a>
%F A200503 (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.
%F A200503 (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.
%F A200503 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...
%e A200503 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.
%t A200503 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 *)
%Y A200503 Cf. A022008 (prime sextuplets), A113274, A113404, A200504, A201596, A201598, A201062, A201073, A201051, A201251, A202281, A202361, A008407, A002386, A233426.
%K A200503 nonn,hard
%O A200503 1,1
%A A200503 _Alexei Kourbatov_, Nov 18 2011