|
Search: id:A098059
|
|
|
| A098059 |
|
Prime(n) such that 4 divides the difference between prime(n) and prime(n+1). |
|
+0
2
|
|
| 7, 13, 19, 37, 43, 67, 79, 89, 97, 103, 109, 127, 163, 193, 199, 211, 223, 229, 277, 307, 313, 349, 359, 379, 389, 397, 401, 439, 449, 457, 463, 467, 479, 487, 491, 499, 509, 613, 619, 643, 661, 673, 683, 701, 719, 739, 743, 757, 761, 769, 797, 823, 853, 859
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
Prime(4) = 7, prime(5) = 11. 4 divides 11-7. 7 is the first entry in the table.
|
|
MATHEMATICA
|
Prime[Select[Range[150], Mod[Prime[ # + 1] - Prime[ # ], 4] == 0 &]] (*Chandler*)
|
|
PROGRAM
|
(PARI) f(n) = for(x=1, n, z=(prime(x+1)-prime(x)); if(z%4==0, print1(prime(x)", ")))
|
|
CROSSREFS
|
Cf. A098058.
Sequence in context: A108295 A071923 A048646 this_sequence A078860 A029710 A078863
Adjacent sequences: A098056 A098057 A098058 this_sequence A098060 A098061 A098062
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Sep 11 2004
|
|
EXTENSIONS
|
Edited by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006
|
|
|
Search completed in 0.002 seconds
|
