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

A049573
Primes p such that x^41 = 2 has a solution mod p.
3
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277
OFFSET
1,1
COMMENTS
Differs from A000040: 83 does not occur.
MATHEMATICA
ok[p_]:= Reduce[Mod[x^41 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[100]], ok] (* Vincenzo Librandi, Sep 14 2012 *)
PROG
(Magma) [p: p in PrimesUpTo(300) | exists(t){x : x in ResidueClassRing(p) | x^41 eq 2}]; // Vincenzo Librandi, Sep 14 2012
CROSSREFS
Cf. A000040, A059236 for primes not in this sequence.
Sequence in context: A238852 A079152 A124590 * A038616 A228296 A176165
KEYWORD
nonn,easy
STATUS
approved