The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001916 Primes p such that the congruence 2^x = 5 (mod p) is solvable.
(Formerly M4772 N2038)
3

%I M4772 N2038 #24 Dec 26 2016 02:03:29

%S 2,3,11,13,19,29,37,41,53,59,61,67,71,79,83,101,107,131,139,149,163,

%T 173,179,181,191,197,199,211,227,239,251,269,271,293,311,317,347,349,

%U 359,373,379,389,401,409,419,421,443,449,461,467,479,491,509,521,523,541,547,557

%N Primes p such that the congruence 2^x = 5 (mod p) is solvable.

%D M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 64.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A001916/b001916.txt">Table of n, a(n) for n = 1..1000</a>

%t Select[Prime[Range[120]], MemberQ[Table[Mod[2^x-5, #], {x, 0, #}], 0]&] (* _Jean-François Alcover_, Aug 29 2011 *)

%Y Cf. A001915.

%K nonn

%O 1,1

%A _N. J. A. Sloane_

%E Better description and more terms from _David W. Wilson_, Dec 12 2000

%E Description corrected by Joe K. Crump (joecr(AT)carolina.rr.com), Jan 17 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 14:08 EDT 2024. Contains 372519 sequences. (Running on oeis4.)