The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033981 Integers k such that 2^k == 7 (mod k). 19
1, 5, 25, 1727, 3830879, 33554425, 19584403931, 25086500333, 23476467919565, 4463061944990945 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A larger term: 15237454403219419167053498809.
LINKS
MATHEMATICA
m = 7; Join[Select[Range[m], Divisible[2^# - m, #] &],
Select[Range[m + 1, 10^7], PowerMod[2, #, #] == m &]] (* Robert Price, Sep 26 2018 *)
PROG
(PARI) isok(n) = Mod(2, n)^n == 7; \\ Michel Marcus, Sep 27 2018
CROSSREFS
Sequence in context: A278120 A039780 A328124 * A099077 A137113 A137115
KEYWORD
nonn,more
AUTHOR
Joe K. Crump (joecr(AT)carolina.rr.com)
EXTENSIONS
Terms 1, 5 prepended by Max Alekseyev, May 18 2011
a(9) added by Max Alekseyev, May 21 2011
a(10) from Max Alekseyev, Jun 17 2012
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 May 14 20:17 EDT 2024. Contains 372533 sequences. (Running on oeis4.)