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!)
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
3, 5, 17, 257, 641, 1217, 14593, 167809, 671233, 1314497, 180449537, 424050817 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3)=17 because n=3*5*17=255 and 2^256 = 1 (mod 255)
CROSSREFS
Sequence in context: A273870 A272060 A333873 * A307843 A023394 A176689
KEYWORD
nonn
AUTHOR
Joe K. Crump (joecr(AT)carolina.rr.com), Jan 09 2001
EXTENSIONS
Offset corrected by Charles R Greathouse IV, Mar 02 2013
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 13:49 EDT 2024. Contains 373400 sequences. (Running on oeis4.)