login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112927 a(n) is the least prime such that the multiplicative order of 2 mod a(n) equals n, or a(n)=1 if no such prime exists. 1
1, 3, 7, 5, 31, 1, 127, 17, 73, 11, 23, 13, 8191, 43, 151, 257, 131071, 19, 524287, 41, 337, 683, 47, 241, 601, 2731, 262657, 29, 233, 331, 2147483647, 65537, 599479, 43691, 71, 37, 223, 174763, 79, 61681 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

If a(n) differs from 1, then a(n) is the minimal prime divisor of A064078(n);

a(n)=n+1 iff n+1 is prime from A001122; a(n)=2n+1 iff 2n+1 is prime from A115591.

CROSSREFS

Cf. A002326 A064078 A001122 A115591.

Sequence in context: A112071 A046561 A097406 * A064078 A186522 A048857

Adjacent sequences:  A112924 A112925 A112926 * A112928 A112929 A112930

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Aug 25 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.