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!)
A058910 Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M). 0

%I #6 Mar 02 2013 23:59:29

%S 3,5,17,257,641,1217,14593,167809,671233,1314497,180449537,424050817

%N Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).

%e a(3)=17 because n=3*5*17=255 and 2^256 = 1 (mod 255)

%K nonn

%O 1,1

%A Joe K. Crump (joecr(AT)carolina.rr.com), Jan 09 2001

%E Offset corrected by _Charles R Greathouse IV_, Mar 02 2013

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 April 25 13:38 EDT 2024. Contains 371970 sequences. (Running on oeis4.)