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)).

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.

EXAMPLE

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.