cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 31-34 of 34 results.

A202361 Record (maximal) gaps between prime decuplets (p+0,2,6,12,14,20,24,26,30,32).

Original entry on oeis.org

12102794130, 141702673770, 424052301750, 699699330330, 714303547230, 739544215410, 1623198312120, 2691533434590, 4207848555330, 4936074819480, 5887574660310, 6562654104930, 7205070907650, 8129061524010, 8362548652500, 9741706748970, 9967327212570
Offset: 1

Views

Author

Alexei Kourbatov, Dec 18 2011

Keywords

Comments

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 (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)).
A202362 lists initial primes in decuplets (p+0,2,6,12,14,20,24,26,30,32) preceding the maximal gaps.

Examples

			The gap of 12102794130 between the very first decuplets starting at p=9853497737 and p=21956291867 is the initial term a(1)=12102794130.
The next gap after the decuplet starting at p=21956291867 is smaller, so it is not in 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)=141702673770.
		

Crossrefs

Cf. A027570 (prime decuplets p+0,2,6,12,14,20,24,26,30,32), A202362, A113274, A113404, A200503, A201596, A201598, A201062, A201073, A201051, A201251, A202281.

Programs

Formula

(1) Upper bound: gaps between prime decuplets (p+0,2,6,12,14,20,24,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.

A202282 Initial prime in prime decuplets (p+0,2,6,8,12,18,20,26,30,32) preceding the maximal gaps in A202281.

Original entry on oeis.org

11, 33081664151, 83122625471, 294920291201, 730121110331, 1291458592421, 4700094892301, 6218504101541, 7908189600581, 10527733922591, 21939572224301, 23960929422161, 30491978649941, 46950720918371, 84254447788781, 118565337622001, 124788318636251, 235474768767851
Offset: 1

Views

Author

Alexei Kourbatov, Dec 15 2011

Keywords

Comments

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. Maximal gaps between decuplets of this type are listed in A202281; see more comments there.

Examples

			The first four gaps (after the decuplets starting at p=11, 33081664151, 83122625471, 294920291201) form an increasing sequence, with the size of each gap setting a new record. Therefore these values of p are in the sequence, as a(1), a(2), a(3), a(4). The next gap is not a record, so the respective initial prime is not in the sequence.
		

Crossrefs

Cf. A027569 (prime decuplets p+0,2,6,8,12,18,20,26,30,32), A202281, A202361, A202362.

Programs

A186634 Irregular triangle, read by rows, giving dense patterns of n primes.

Original entry on oeis.org

0, 2, 0, 2, 6, 0, 4, 6, 0, 2, 6, 8, 0, 2, 6, 8, 12, 0, 4, 6, 10, 12, 0, 4, 6, 10, 12, 16, 0, 2, 6, 8, 12, 18, 20, 0, 2, 8, 12, 14, 18, 20, 0, 2, 6, 8, 12, 18, 20, 26, 0, 2, 6, 12, 14, 20, 24, 26, 0, 6, 8, 14, 18, 20, 24, 26, 0, 2, 6, 8, 12, 18, 20, 26, 30, 0, 2, 6, 12, 14, 20, 24, 26, 30, 0, 4, 6, 10, 16, 18, 24, 28, 30, 0, 4, 10, 12, 18, 22, 24, 28, 30, 0, 2, 6, 8, 12, 18, 20, 26, 30, 32, 0, 2, 6, 12, 14, 20, 24, 26, 30, 32
Offset: 2

Views

Author

T. D. Noe, Feb 24 2011

Keywords

Comments

The first pattern (0,2) is for twin primes (p,p+2). Row n contains A083409(n) patterns, each one consisting of 0 followed by n-1 terms. In each row the patterns are in lexicographic order.
These numbers (in a slightly different order) appear in Table 1 of the paper by Tony Forbes. Sequence A186702 gives the least prime starting a given pattern.

Examples

			The irregular triangle begins:
0, 2
0, 2, 6, 0, 4, 6
0, 2, 6, 8
0, 2, 6, 8, 12, 0, 4, 6, 10, 12
0, 4, 6, 10, 12, 16
0, 2, 6, 8, 12, 18, 20, 0, 2, 8, 12, 14, 18, 20
		

Crossrefs

A350830 Number of prime 10-tuples (or decaplets) with initial member (A257127) between 10^(n-1) and 10^n.

Original entry on oeis.org

0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 4, 15, 81, 357, 1685, 8256
Offset: 1

Views

Author

M. F. Hasler, Mar 01 2022

Keywords

Comments

"Between 10^(n-1) and 10^n" is equivalent to saying "with n (decimal) digits".
A prime 10-tuple (or decaplet) is a sequence of 9 consecutive primes (p1, ..., p10) of minimum possible diameter p10 - p1 = 32.
Terms a(1)-a(16) computed from b-files a(1..10^4) for A027569 and A027570. Using Luhn's data (cf. LINKS) one can obtain a(18) and a(19).
So far the last term of all the decaplets has the same number of digits as the initial term.

Examples

			a(2) = 1 because 11 is the only two-digit prime to start a prime decaplet, i.e., member of A257127.
a(n) = 0 for all other n < 10 because the next larger prime decaplet is made of 10-digit primes, A257127(2) = 9853497737 and successors.
a(10) = 1 because there is only one prime decaplet made of 10-digit primes.
a(11) = 4 because there are only four terms in A257127 (for indices n = 3..6) which have 11 digits.
		

Crossrefs

Cf. A257127 (initial members p of prime 9-tuples (p, ..., p+32)), A027569, A027570 (idem, specifically for each of the two possible patterns).
Cf. A350825 - A350829: similar for quintuples, sextuples, septuples, octuples and 9-tuples.

Programs

  • PARI
    (D(v)=v[^1]-v[^-1])( [setsearch(A257127,10^n,1) | n<-[0..16]] ) \\ where A257127 is a vector of at least 10400 terms of that sequence.
Previous Showing 31-34 of 34 results.