cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Vincenzo Librandi, Jan 23 2015

Keywords

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

Examples

			p=29 is in this sequence because 29+31 = 60 is divisible by 5.
		

Crossrefs

Cf. similar sequences listed in A253969.

Programs

  • Magma
    [p: p in PrimesUpTo(1500) | (p+NextPrime(p)) mod 5 eq 0];
    
  • 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 *)
  • PARI
    forprime(p=1,10^3,if(!((p+nextprime(p+1))%5),print1(p,", "))) \\ Derek Orr, Jan 30 2015