|
Search: id:A112795
|
|
|
| A112795 |
|
Primes such that the sum of the predecessor and successor primes is divisible by 13. |
|
+0
15
|
|
| 79, 103, 139, 233, 271, 389, 401, 457, 587, 619, 641, 769, 883, 967, 1013, 1031, 1153, 1213, 1249, 1289, 1301, 1429, 1523, 1559, 1571, 1699, 1721, 1789, 1847, 1901, 2039, 2089, 2111, 2273, 2297, 2459, 2579, 2593, 2663, 3359, 3371, 3373, 3449, 3491, 3527
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There is a trivial analogy to every prime beyond 3, but mod 2. A112681 is analogous to this, but mod 3. A112731 is analogous to this, but mod 7. A112xxx is analogous to this, but mod 11.
|
|
FORMULA
|
a(n) = prime(i) is in this sequence iff prime(i-1)+prime(i+1) = 0 mod 13. a(n) = A000040(i) is in this sequence iff A000040(i-1)+A000040(i+1) = 0 mod 13.
|
|
EXAMPLE
|
a(1) = 79 because prevprime(79) + nextprime(79) = 73 + 83 = 156 = 13 * 12.
a(2) = 103 because prevprime(103) + nextprime(103) = 101 + 107 = 208 = 13 * 16.
a(3) = 139 because prevprime(139) + nextprime(139) = 137 + 149 = 286 = 13 * 22.
a(4) = 233 because prevprime(233) + nextprime(233) = 229 + 239 = 468 = 13 * 36.
|
|
MATHEMATICA
|
Prime@ Select[Range[2, 496], Mod[Prime[ # - 1] + Prime[ # + 1], 13] == 0 &] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A000040, A112681, A112794, A112731, A112789, A112795, A112796, A112804, A112847, A112859, A113155, A113156, A113157, A113158.
Sequence in context: A117840 A033250 A139922 this_sequence A107162 A135143 A139503
Adjacent sequences: A112792 A112793 A112794 this_sequence A112796 A112797 A112798
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Jan 01 2006
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Jan 05 2006
|
|
|
Search completed in 0.002 seconds
|
