cp's OEIS Frontend

A253970 Primes p such that p + nextprime(p) is divisible by 5.

%I A253970 #16 Sep 08 2022 08:46:11
%S A253970 2,13,29,43,47,59,103,113,149,157,163,167,179,193,199,223,239,257,269,
%T A253970 293,313,367,401,419,463,491,509,557,569,587,599,607,613,619,643,647,
%U A253970 659,673,677,701,727,761,773,809,823,853,863,883,911,947,953,977,1019
%N A253970 Primes p such that p + nextprime(p) is divisible by 5.
%C A253970 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
%H A253970 Harvey P. Dale, <a href="/A253970/b253970.txt">Table of n, a(n) for n = 1..1000</a>
%e A253970 p=29 is in this sequence because 29+31 = 60 is divisible by 5.
%t A253970 Prime@Select[Range[300], Mod[Prime[#] + Prime[# + 1], 5]==0 &]
%t A253970 Transpose[Select[Partition[Prime[Range[200]],2,1],Divisible[Total[ #],5]&]] [[1]] (* _Harvey P. Dale_, Feb 10 2015 *)
%o A253970 (Magma) [p: p in PrimesUpTo(1500) | (p+NextPrime(p)) mod 5 eq 0];
%o A253970 (PARI) forprime(p=1,10^3,if(!((p+nextprime(p+1))%5),print1(p,", "))) \\ _Derek Orr_, Jan 30 2015
%Y A253970 Cf. similar sequences listed in A253969.
%K A253970 nonn,easy
%O A253970 1,1
%A A253970 _Vincenzo Librandi_, Jan 23 2015