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!)
 A072936 Primes p that do not divide 2^x+1 for any x>=1. 6
 2, 7, 23, 31, 47, 71, 73, 79, 89, 103, 127, 151, 167, 191, 199, 223, 233, 239, 263, 271, 311, 337, 359, 367, 383, 431, 439, 463, 479, 487, 503, 599, 601, 607, 631, 647, 719, 727, 743, 751, 823, 839, 863, 881, 887, 911, 919, 937, 967, 983, 991, 1031, 1039, 1063 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also, primes p such that p^2 does not divide 2^x+1 for any x>=1. A prime p cannot divide 2^x+1 if the multiplicative order of 2 (mod p) is odd. - T. D. Noe, Aug 22 2004 Differs from A049564 first at p=6529, which is the 250th entry in A049564 related to 279^32 =2 mod 6529, but absent here because 6529 divides 2^51+1. [From R. J. Mathar, Sep 25 2008] REFERENCES A. K. Devaraj, "Euler's Generalization of Fermat's Theorem-A Further Generalization", in ISSN #1550-3747, Proceedings of Hawaii Intl Conference on Statistics, Mathematics & Related Fields, 2004. LINKS T. D. Noe, Table of n, a(n) for n=1..1000 CROSSREFS Cf. A040098, A049096, A014664 (multiplicative order of 2 mod n-th prime). Sequence in context: A045315 A072935 A049564 * A049584 A045382 A049560 Adjacent sequences:  A072933 A072934 A072935 * A072937 A072938 A072939 KEYWORD nonn AUTHOR Benoit Cloitre, Aug 20 2002 EXTENSIONS Edited by T. D. Noe, Aug 22 2004 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 6 21:48 EST 2019. Contains 329809 sequences. (Running on oeis4.)