login
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
OFFSET
1,1
EXAMPLE
a(3)=17 because n=3*5*17=255 and 2^256 = 1 (mod 255)
CROSSREFS
Sequence in context: A273870 A272060 A333873 * A373580 A307843 A023394
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