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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033983 Integers n such that 2^n == 15 (mod n). 12
 1, 13, 481, 44669, 1237231339, 1546675117, 62823773963, 284876771881, 1119485807557, 26598440989093 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS No other terms below 10^14. LINKS Joe K. Crump, 2^n mod n OEIS Wiki, 2^n mod n MATHEMATICA m = 15; Join[Select[Range[m], Divisible[2^# - m, #] &], Select[Range[m + 1, 10^3], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *) CROSSREFS Cf. A125000, A124974, A033982, A033981, A050259, A124977, A124965, A015911, A015910. Cf. A015910, A015911, A033981, A050259, A124965, A124974, A124977, A015910, A015911, A033982, A125000. Sequence in context: A012143 A173403 A220560 * A055412 A196911 A197078 Adjacent sequences: A033980 A033981 A033982 * A033984 A033985 A033986 KEYWORD nonn,more AUTHOR Joe K. Crump (joecr(AT)carolina.rr.com) EXTENSIONS One more term from Joe K. Crump (joecr(AT)carolina.rr.com), Jun 20 2000 Edited by N. J. A. Sloane, Jul 03 2008 at the suggestion of R. J. Mathar Terms 1, 13 prepended by Max Alekseyev, May 18 2011 a(10) from Max Alekseyev, Dec 15 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.

Last modified April 1 09:50 EDT 2023. Contains 361688 sequences. (Running on oeis4.)