|
%I #26 Apr 03 2023 10:36:10
%S 3,37,71,139,173,241,479,547,683,751,853,887,1091,1193,1499,1567,1601,
%T 1669,1873,1907,2111,2179,2213,2281,2383,2417,2621,2689,2791,2927,
%U 3301,3539,3607,3709,3947,4049,4219,4253,4423,4457,4729,4831,4933,4967,5171
%N Primes congruent to 3 mod 17.
%C Used in a primality test.
%H Vincenzo Librandi, <a href="/A092074/b092074.txt">Table of n, a(n) for n = 1..1000</a>
%H Chris Caldwell, <a href="https://t5k.org/curios/includes/file.php?file=primetest.html">Prime test</a>.
%t Select[ Range[3,5000,17], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Apr 03 2011 *)
%t Select[Prime[Range[700]],Mod[#,17]==3&] (* _Harvey P. Dale_, Dec 03 2021 *)
%o (PARI) forprime(i=1,6000,if(Mod(i,17)==3,print1(i,",")))
%o (Magma) [ p: p in PrimesUpTo(10000) | p mod 17 eq 3 ]; // _Vincenzo Librandi_, Apr 08 2011
%Y Cf. A129484.
%K nonn,easy
%O 1,1
%A Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Mar 29 2004
%E More terms from Mohammed Bouayoun (bouyao(AT)wanadoo.fr) and _Ray Chandler_, Mar 30 2004
|
