|
|
A039949
|
|
Primes of the form 30n - 13.
|
|
33
|
|
|
17, 47, 107, 137, 167, 197, 227, 257, 317, 347, 467, 557, 587, 617, 647, 677, 797, 827, 857, 887, 947, 977, 1097, 1187, 1217, 1277, 1307, 1367, 1427, 1487, 1607, 1637, 1667, 1697, 1787, 1847, 1877, 1907, 1997, 2027, 2087, 2207, 2237, 2267, 2297, 2357, 2417
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This linear form produces the most primes for n between 1 and 1000 (411/1000).
Primes congruent to 17 (mod 30). - Omar E. Pol, Aug 15 2007
Primes ending in 7 with (SOD-1)/3 non-integer where SOD is sum of digits. - Ki Punches
Or primes p such that (p mod 3) = (p mod 5) and (p mod 2) <> (p mod 3), (p > 2). - Mikk Heidemaa, Jan 19 2016
|
|
REFERENCES
|
C. Clawson, Mathematical Mysteries, Plenum Press, 1996, p. 173
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Select[Prime[Range[1000]], MemberQ[{17}, Mod[#, 30]]&] (* Vincenzo Librandi, Aug 04 2012 *)
Select[Range[17, 3000, 30], PrimeQ] (* Zak Seidov, Apr 15 2015 *)
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(3000) | p mod 30 in [17]]; // Vincenzo Librandi, Aug 04 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|