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”).

A147603
Primes congruent to (1,1,2) mod 3, see comment.
0
7, 13, 17, 19, 31, 41, 43, 61, 71, 73, 79, 83, 97, 103, 107, 109, 127, 131, 139, 151, 167, 181, 193, 197, 199, 211, 227, 229, 241, 251, 271, 277, 281, 283, 307, 311, 313, 331, 347, 349, 367, 383, 397, 409, 419, 421, 433, 443, 457, 463, 467, 487, 499, 503, 523
OFFSET
1,1
COMMENTS
Primes in increasing order such that, for k=0,1,2,...:
a(3k+1) = primes congruent to 1 mod 3,
a(3k+2) = primes congruent to 1 mod 3,
a(3k+3) = primes congruent to 2 mod 3.
Prime analog to A147534 Numbers congruent to (1,1,2) mod 3.
MATHEMATICA
s={}; n3=1; Do[Do[If[Mod[p=Prime[n], 3]==1, AppendTo[s, p]; n1=n+1; Break[]], {n, n3, 1000}]; Do[If[Mod[p=Prime[n], 3]==1, AppendTo[s, p]; n2=n+1; Break[]], {n, n1, 1000}]; Do[If[Mod[p=Prime[n], 3]==2, AppendTo[s, p]; n3=n+1; Break[]], {n, n2, 1000}], {55}]; s
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Nov 08 2008
STATUS
approved