A045414 Primes congruent to {0, 3} mod 5.

3, 5, 13, 23, 43, 53, 73, 83, 103, 113, 163, 173, 193, 223, 233, 263, 283, 293, 313, 353, 373, 383, 433, 443, 463, 503, 523, 563, 593, 613, 643, 653, 673, 683, 733, 743, 773, 823, 853, 863, 883, 953, 983, 1013, 1033, 1063, 1093, 1103, 1123, 1153, 1163, 1193

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• easy

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

Crossrefs

Same as A030431 with addition of primes congruent to 0 mod 5, i.e., 5.

Cf. A000040.

Programs

Magma

[ p: p in PrimesUpTo(1200) | p mod 5 in {0,3} ]; // Vincenzo Librandi, Aug 12 2012

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 *)

Extensions

Extended by Ray Chandler, Nov 07 2006