|
Search: id:A162566
|
|
|
| A162566 |
|
Those primes p where (q-p) divides (p+1), where q is the least prime > p. |
|
+0
2
|
|
| 2, 3, 5, 7, 11, 17, 19, 23, 29, 41, 43, 47, 53, 59, 67, 71, 79, 83, 101, 103, 107, 127, 131, 137, 139, 149, 163, 167, 173, 179, 191, 197, 223, 227, 233, 239, 251, 257, 263, 269, 281, 293, 307, 311, 347, 353, 359, 379, 383, 409, 419, 431, 439, 443, 461, 463, 467
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Algorithm below can easily be run up to P(100000) [From Jasper Mulder (jasper.mulder(AT)planet.nl), Jul 15 2009]
|
|
EXAMPLE
|
The 17th prime is 59 and the 18th prime is 61. (61-59) = 2, and 2 divides 59+1 = 60. So, 59 is in the sequence.
|
|
MATHEMATICA
|
For[n = 1, n <= 1000, n++, If[Mod[Prime[n] + 1, Prime[n + 1] - Prime[n]] == 0, Print[Prime[n]]]] [From Jasper Mulder (jasper.mulder(AT)planet.nl), Jul 15 2009]
|
|
CROSSREFS
|
A162565
Sequence in context: A042988 A167135 A129990 this_sequence A040085 A040049 A092787
Adjacent sequences: A162563 A162564 A162565 this_sequence A162567 A162568 A162569
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 06 2009
|
|
EXTENSIONS
|
More terms from Jasper Mulder (jasper.mulder(AT)planet.nl), Jul 15 2009
|
|
|
Search completed in 0.002 seconds
|
