OFFSET
1,1
COMMENTS
Because 5 is the only prime congruent to zero mod 5, it is far more efficient to insert 5 and search only for primes congruent to 3 mod 5. - Harvey P. Dale, Jun 24 2017
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
MATHEMATICA
Select[Prime@Range[200], MemberQ[{0, 3}, Mod[ #, 5]] &] (* Ray Chandler, Nov 07 2006 *)
Insert[Select[Prime[Range[200]], Mod[#, 5]==3&], 5, 2] (* See comment above *) (* Harvey P. Dale, Jun 24 2017 *)
PROG
(Magma) [ p: p in PrimesUpTo(1200) | p mod 5 in {0, 3} ]; // Vincenzo Librandi, Aug 12 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Extended by Ray Chandler, Nov 07 2006
STATUS
approved