|
Search: id:A129855
|
|
|
| A129855 |
|
Primes that are one greater than the difference between consecutive primes. |
|
+0
1
|
|
| 2, 3, 3, 5, 3, 5, 3, 5, 7, 3, 7, 5, 3, 5, 7, 7, 3, 7, 5, 3, 7, 5, 7, 5, 3, 5, 3, 5, 5, 7, 3, 11, 3, 7, 7, 5, 7, 7, 3, 11, 3, 5, 3, 13, 13, 5, 3, 5, 7, 3, 11, 7, 7, 7, 3, 7, 5, 3, 11, 5, 3, 5, 7, 11, 3, 5, 7, 7, 7, 5, 7, 5, 11, 3, 11, 3, 7, 5, 7, 5, 3, 5, 13, 5, 5, 7, 13, 3, 19, 7, 11, 7, 7, 3, 7, 11, 7, 7, 3
(list; graph; listen)
|
|
|
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 2,3,3,5 the first four entries in the table.
|
|
PROGRAM
|
(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
|
Adjacent sequences: A129852 A129853 A129854 this_sequence A129856 A129857 A129858
Sequence in context: A063256 A131320 A119912 this_sequence A076368 A071049 A111607
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), May 23 2007
|
|
|
Search completed in 0.002 seconds
|
