|
| |
|
|
A098058
|
|
Prime(n) such that 4 does not divide the difference between prime(n) and prime(n+1).
|
|
10
| |
|
|
2, 3, 5, 11, 17, 23, 29, 31, 41, 47, 53, 59, 61, 71, 73, 83, 101, 107, 113, 131, 137, 139, 149, 151, 157, 167, 173, 179, 181, 191, 197, 227, 233, 239, 241, 251, 257, 263, 269, 271, 281, 283, 293, 311, 317, 331, 337, 347, 353, 367, 373, 383, 409, 419, 421, 431
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| Prime(2) = 3, prime(3) = 5. 4 does not divide 5-3 so prime(2)=3 is in the sequence.
|
|
|
MATHEMATICA
| Prime[Select[Range[100], Mod[Prime[ # + 1] - Prime[ # ], 4] !=0 &]] (*Chandler*)
|
|
|
PROG
| (PARI) f(n) = for(x=1, n, z=(prime(x+1)-prime(x)); if(z%4, print1(prime(x)", ")))
|
|
|
CROSSREFS
| Cf. A098059.
Sequence in context: A049583 A049596 A049571 * A040054 A093503 A040036
Adjacent sequences: A098055 A098056 A098057 * A098059 A098060 A098061
|
|
|
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
|
| |
|
|
