login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A253970
Primes p such that p + nextprime(p) is divisible by 5.
2
2, 13, 29, 43, 47, 59, 103, 113, 149, 157, 163, 167, 179, 193, 199, 223, 239, 257, 269, 293, 313, 367, 401, 419, 463, 491, 509, 557, 569, 587, 599, 607, 613, 619, 643, 647, 659, 673, 677, 701, 727, 761, 773, 809, 823, 853, 863, 883, 911, 947, 953, 977, 1019
OFFSET
1,1
COMMENTS
Primes p such that p + nextprime(p) is divisible by 10 is the same as this sequence without the term 2. - Derek Orr, Jan 30 2015
LINKS
EXAMPLE
p=29 is in this sequence because 29+31 = 60 is divisible by 5.
MATHEMATICA
Prime@Select[Range[300], Mod[Prime[#] + Prime[# + 1], 5]==0 &]
Transpose[Select[Partition[Prime[Range[200]], 2, 1], Divisible[Total[ #], 5]&]] [[1]] (* Harvey P. Dale, Feb 10 2015 *)
PROG
(Magma) [p: p in PrimesUpTo(1500) | (p+NextPrime(p)) mod 5 eq 0];
(PARI) forprime(p=1, 10^3, if(!((p+nextprime(p+1))%5), print1(p, ", "))) \\ Derek Orr, Jan 30 2015
CROSSREFS
Cf. similar sequences listed in A253969.
Sequence in context: A366720 A174049 A141336 * A361836 A298392 A299510
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jan 23 2015
STATUS
approved