|
|
A033981
|
|
Integers k such that 2^k == 7 (mod k).
|
|
19
|
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|