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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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

Table of n, a(n) for n=1..12.

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

Adjacent sequences:  A058907 A058908 A058909 * A058911 A058912 A058913

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 20:51 EST 2020. Contains 338938 sequences. (Running on oeis4.)