login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A092178
Primes congruent to 8 mod 13.
11
47, 73, 151, 229, 281, 307, 359, 463, 541, 593, 619, 827, 853, 983, 1009, 1061, 1087, 1217, 1321, 1373, 1399, 1451, 1607, 1789, 1867, 1997, 2153, 2179, 2309, 2543, 2621, 2647, 2699, 2777, 2803, 3011, 3037, 3089, 3167, 3271, 3323, 3557, 3583, 3739, 3947
OFFSET
1,1
LINKS
MATHEMATICA
lst={}; Do[p=Prime[n]; If[Mod[p, 13]==8, AppendTo[lst, p]], {n, 7!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 26 2009 *)
Select[Prime@Range[600], MemberQ[{8}, Mod[#, 13]] &] (* Vincenzo Librandi, Aug 14 2012 *)
Select[Range[8, 4000, 13], PrimeQ] (* Bruno Berselli, Aug 17 2012 *)
PROG
(Magma) [p: p in PrimesUpTo(4500) | p mod 13 eq 8 ]; // Vincenzo Librandi, Aug 14 2012
(PARI) is(n)=isprime(n) && n%13==8 \\ Charles R Greathouse IV, Jul 01 2016
CROSSREFS
Sequence in context: A282633 A369957 A052231 * A338273 A165335 A039425
KEYWORD
nonn,easy
AUTHOR
Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Apr 01 2004
EXTENSIONS
More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004
STATUS
approved