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

A049561
Primes p such that x^29 = 2 has a solution mod p.
4
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 61, 67, 71, 73, 79, 83, 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, 239, 241, 251, 257, 263, 269, 271, 277, 281
OFFSET
1,1
COMMENTS
Complement of A059256 relative to A000040. - Vincenzo Librandi, Sep 14 2012
MATHEMATICA
ok[p_]:= Reduce[Mod[x^29 - 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^29 eq 2}]; // Vincenzo Librandi, Sep 14 2012
CROSSREFS
Sequence in context: A050246 A229106 A118849 * A080191 A073350 A167773
KEYWORD
nonn,easy
STATUS
approved