login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015940 Positive integers n such that 2^n == -3 (mod n). 8
1, 5, 917, 3223, 62911, 326329, 395819, 33504053, 4446226763, 17556128765, 141613728437, 5259417592253, 113837290408523 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

No other terms below 10^16.

Larger term: 18468744643735483963902321985787. - Max Alekseyev, Aug 01 2011

LINKS

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

OEIS Wiki, 2^n mod n

MATHEMATICA

Do[ If[ PowerMod[ 2, n, n ] + 3 == n, Print[n]], { n, 1, 10^9, 2 } ]

CROSSREFS

Cf. A050259.

Sequence in context: A094630 A284637 A173914 * A093853 A195627 A318066

Adjacent sequences:  A015937 A015938 A015939 * A015941 A015942 A015943

KEYWORD

nonn,more

AUTHOR

Robert G. Wilson v

EXTENSIONS

Corrected and extended by Olivier Wittenberg, May 23 2004.

a(10)-a(13) from Max Alekseyev, Aug 01 2011

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 November 26 11:47 EST 2022. Contains 358359 sequences. (Running on oeis4.)