|
%I #17 Sep 08 2022 08:45:13
%S 47,73,151,229,281,307,359,463,541,593,619,827,853,983,1009,1061,1087,
%T 1217,1321,1373,1399,1451,1607,1789,1867,1997,2153,2179,2309,2543,
%U 2621,2647,2699,2777,2803,3011,3037,3089,3167,3271,3323,3557,3583,3739,3947
%N Primes congruent to 8 mod 13.
%H Vincenzo Librandi, <a href="/A092178/b092178.txt">Table of n, a(n) for n = 1..1000</a>
%t lst={};Do[p=Prime[n];If[Mod[p,13]==8,AppendTo[lst,p]],{n,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Feb 26 2009 *)
%t Select[Prime@Range[600], MemberQ[{8}, Mod[#, 13]] &] (* _Vincenzo Librandi_, Aug 14 2012 *)
%t Select[Range[8, 4000, 13], PrimeQ] (* _Bruno Berselli_, Aug 17 2012 *)
%o (Magma) [p: p in PrimesUpTo(4500) | p mod 13 eq 8 ]; // _Vincenzo Librandi_, Aug 14 2012
%o (PARI) is(n)=isprime(n) && n%13==8 \\ _Charles R Greathouse IV_, Jul 01 2016
%K nonn,easy
%O 1,1
%A Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Apr 01 2004
%E More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004
|
