[go: up one dir, main page]

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

A354084
Primes p such that p mod 6 = p mod 8.
0
2, 3, 5, 29, 53, 73, 97, 101, 149, 173, 193, 197, 241, 269, 293, 313, 317, 337, 389, 409, 433, 457, 461, 509, 557, 577, 601, 653, 673, 677, 701, 769, 773, 797, 821, 937, 941, 1009, 1013, 1033, 1061, 1109, 1129, 1153, 1181, 1201, 1229, 1249, 1277, 1297, 1301
OFFSET
1,1
COMMENTS
Corresponding moduli: 2, 3, 5, 5, 5, 1, 1, 5, 5, 5, 1, 5, 1, 5, 5, 1, 5, 1, 5, 1, 1, 1, 5, 5, 5, 1, 1, 5, 1, 5, 5, 1, 5, 5, 5, 1, 5, 1, 5, 1, 5, 5, 1, 1, 5, 1.
After 3 - only ones and fives.
MATHEMATICA
s = {}; p = 2; Do[If[Mod[p, 6] == Mod[p, 8], AppendTo[s, p]]; p = NextPrime[p], {200}]; s
CROSSREFS
Sequence in context: A038962 A309179 A019400 * A331399 A084599 A062167
KEYWORD
nonn
AUTHOR
Zak Seidov, Jun 05 2022
STATUS
approved