|
| |
|
|
A129856
|
|
Primes that are one less than the difference between consecutive primes.
|
|
1
| |
|
|
3, 3, 3, 5, 5, 3, 3, 5, 5, 5, 3, 5, 3, 5, 7, 3, 3, 3, 13, 3, 5, 5, 5, 3, 5, 5, 3, 11, 11, 3, 3, 5, 5, 5, 5, 5, 3, 13, 3, 3, 13, 5, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 5, 3, 5, 7, 3, 3, 11, 7, 3, 7, 3, 5, 11, 17, 5, 5, 5, 5, 5, 5, 5, 5, 3, 11, 3, 5, 5, 11, 3, 5, 7, 7, 7, 5, 5, 3, 7, 5, 3, 7, 3, 13, 11, 3, 13, 3, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Cino Hilliard, Frequency of primes.
|
|
|
EXAMPLE
| The first 4 consecutive prime pairs are (2,3),(3,5),(5,7),(7,11). The differences - 1 are the primes 0,1,1,3. The first three of these are not prime so 3 is the first entry in the table.
|
|
|
PROG
| (PARI) diffp1p2(n) = { local(p1, p2, y); for(x=1, n, p1=prime(x); p2=prime(x+1); y=(p2-p1)- 1; if(isprime(y), print1(y", ") ) ) }
|
|
|
CROSSREFS
| Sequence in context: A083574 A108025 A192451 * A136800 A126661 A162226
Adjacent sequences: A129853 A129854 A129855 * A129857 A129858 A129859
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), May 23 2007
|
| |
|
|
