A192870 The maximum integer M such that there are no prime n-tuplets of any possible pattern between M^2 and (M+1)^2, or -1 if no such maximum M exists.

0, 122, 3113, 719377, 15467683

Offset

1,2

Comments

All terms are conjectural. A prime n-tuplet is defined as the densest permissible prime constellation containing n primes. The term a(2) corresponds to twin primes, a(3) to prime triplets, a(4) to prime quadruplets, etc. Extensive computational evidence suggests that these terms are valid. However, there is no proof that the greatest integer M exists - not even for a subset of values of n. If one could find a constructive existence proof, then Twin Prime Conjecture as well as Legendre's Conjecture would require just a trivial additional step. - Edited by Hugo Pfoertner, Sep 15 2021

Note that, for some n, a prime (n+1)-tuple must include a prime n-tuple; e.g., prime quadruplets include prime triples. Thus, if any term is -1, subsequent terms may be -1, too. - Franklin T. Adams-Watters and Alexei Kourbatov, Jul 14 2011

However, for other n, a prime (n+1)-tuple does NOT include a prime n-tuple; e.g. 7-tuples {p, p + 2, p + 6, p + 8, p + 12, p + 18, p + 20} do not contain 6-tuples {p-4, p, p + 2, p + 6, p + 8, p + 12}; see List of all possible patterns of prime k-tuplets by Tony Forbes.

Assuming the Hardy-Littlewood k-tuple conjecture, the average distance between k-tuples grows slower than the distance between consecutive squares. This is an indication (but not a proof) that the maximum integer M in this sequence does exist for all n.

a(6) > 3005845357, because there is a gap of size 7191214380 between consecutive sextuplets, enclosing in its interior the interval between the two squares 3005845357^2 and 3005845358^2, found with a fast sieving program provided by Martin Raab, i.e., 9035106309825245467 < 3005845357^2 = 9035106310198457449 < 3005845358^2 = 9035106316210148164 < 9035106317016459847. Statistical considerations based on the observed scatter of maximum gap sizes (see A200503 and data provided at N. Luhn link) suggest a range of 3*10^9 < a(6) < 6*10^9. In a private communication Martin Raab provided the following estimates for the order of magnitude of the next terms: a(7) ~= 1.1*10^11, a(8) ~= 1.6*10^12, a(9) ~= 6*10^13, a(10) ~= 3*10^16. - Hugo Pfoertner, Jul 31 2023, corrected Oct 23 2023

Links

Table of n, a(n) for n=1..5.

Tony Forbes and Norman Luhn, Patterns of prime k-tuplets & the Hardy-Littlewood constants

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.

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

Norman Luhn, Record Gaps Between Prime Sextuplets, up to 10^17

Eric W. Weisstein, k-Tuple Conjecture

Example

The term a(4)=719377 means that there are no prime quadruplets between 719377^2 and 719378^2, but there are prime quadruplets between m^2 and (m+1)^2 for m > 719377.

Crossrefs

Cf. A091592: Numbers n such that there are no twin primes between n^2 and (n+1)^2; A008407: Minimal width of prime n-tuplet.

Cf. A020497, A200503.

Sequence in context: A208049 A276252 A259528 * A208432 A275356 A275146

Adjacent sequences: A192867 A192868 A192869 * A192871 A192872 A192873

Keyword

nonn,hard,more

Author

Alexei Kourbatov, Jul 11 2011

Extensions

First term, 0, added and offset changed by Zak Seidov, Jul 11 2011

Clarification regarding patterns in the title added by Hugo Pfoertner, Sep 15 2021

Status

approved