The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040162 Primes p such that x^5 = 3 has no solution mod p. 2
 11, 31, 61, 71, 101, 131, 151, 181, 191, 211, 241, 251, 271, 281, 311, 331, 401, 421, 461, 521, 541, 571, 601, 631, 641, 691, 701, 751, 811, 821, 881, 911, 941, 971, 991, 1031, 1061, 1151, 1181, 1201, 1231, 1291, 1301, 1321, 1361, 1381, 1451, 1481, 1531 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Complement of A040161 relative to A000040. - Vincenzo Librandi, Sep 18 2012 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 MATHEMATICA ok[p_]:= Reduce[Mod[x^5 - 3, p] == 0, x, Integers] == False; Select[Prime[Range[300]], ok] (* Vincenzo Librandi, Sep 18 2012 *) PROG (Magma) [ p: p in PrimesUpTo(1600) | forall(t){x : x in ResidueClassRing(p) | x^5 ne 3} ]; // Klaus Brockhaus, Jun 03 2009 (Magma) [p: p in PrimesUpTo(1550) | not exists{x : x in ResidueClassRing(p) | x^5 eq 3} ]; // Vincenzo Librandi, Sep 18 2012 CROSSREFS Cf. A040161 (primes p such that x^5 = 3 has a solution mod p). Sequence in context: A028877 A087394 A196117 * A113747 A202007 A125239 Adjacent sequences: A040159 A040160 A040161 * A040163 A040164 A040165 KEYWORD nonn,easy AUTHOR EXTENSIONS More terms from Klaus Brockhaus, Jun 03 2009 STATUS approved

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

Last modified December 1 06:09 EST 2022. Contains 358454 sequences. (Running on oeis4.)