The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049567 Primes p such that x^35 = 2 has a solution mod p. 2
 2, 3, 5, 7, 13, 17, 19, 23, 37, 47, 53, 59, 67, 73, 79, 83, 89, 97, 103, 107, 109, 137, 139, 149, 151, 157, 163, 167, 173, 179, 193, 199, 223, 227, 229, 233, 241, 251, 257, 263, 269, 277, 283, 293, 307, 313, 317, 347, 349, 353, 359, 367, 373, 383, 389, 397, 409 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Complement of A059337 relative to A000040. - Vincenzo Librandi, Sep 14 2012 LINKS R. J. Mathar, Table of n, a(n) for n = 1..1000 MATHEMATICA ok[p_]:= Reduce[Mod[x^35 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[100]], ok] (* Vincenzo Librandi, Sep 14 2012 *) PROG (MAGMA) [p: p in PrimesUpTo(500) | exists(t){x : x in ResidueClassRing(p) | x^35 eq 2}]; // Vincenzo Librandi, Sep 14 2012 (PARI) N=10^4;  default(primelimit, N); ok(p, r, k)={ return ( (p==r) || (Mod(r, p)^((p-1)/gcd(k, p-1))==1) ); } forprime(p=2, N, if (ok(p, 2, 35), print1(p, ", "))); /* Joerg Arndt, Sep 21 2012 */ CROSSREFS Cf. A000040, A059337. Sequence in context: A255203 A233577 A233041 * A293048 A134204 A134207 Adjacent sequences:  A049564 A049565 A049566 * A049568 A049569 A049570 KEYWORD nonn,easy AUTHOR 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 August 4 16:34 EDT 2020. Contains 336202 sequences. (Running on oeis4.)