This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059349 Primes p such that x^32 = 2 has no solution mod p. 2
 3, 5, 11, 13, 17, 19, 29, 37, 41, 43, 53, 59, 61, 67, 83, 97, 101, 107, 109, 113, 131, 137, 139, 149, 157, 163, 173, 179, 181, 193, 197, 211, 227, 229, 241, 251, 257, 269, 277, 281, 283, 293, 307, 313, 317, 331, 347, 349, 353, 373, 379, 389, 397, 401, 409, 419 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Complement of A049564 relative to A000040. Differs from A014662 first at p=6529, then at p=21569. [From R. J. Mathar, Oct 05 2008] LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 MATHEMATICA ok[p_] := Reduce[Mod[x^32 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[100]], ok ] (* Vincenzo Librandi, Sep 20 2012  *) PROG (MAGMA) [p: p in PrimesUpTo(450) | not exists{x : x in ResidueClassRing(p) | x^32 eq 2 }]; // Vincenzo Librandi, Sep 20 2012 CROSSREFS Sequence in context: A045403 A059641 A014662 * A045316 A040100 A076757 Adjacent sequences:  A059346 A059347 A059348 * A059350 A059351 A059352 KEYWORD nonn,easy AUTHOR Klaus Brockhaus, Jan 27 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)