|
|
A116622
|
|
Positive integers n such that 13^n == 2 (mod n).
|
|
17
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[1, 500000], Mod[13^#, #] == 2 &] (* G. C. Greubel, Nov 19 2017 *)
Join[{1}, Select[Range[5000000], PowerMod[13, #, #] == 2 &]] (* Robert Price, Apr 10 2020 *)
|
|
PROG
|
(PARI) isok(n) = Mod(13, n)^n == 2; \\ Michel Marcus, Nov 19 2017
|
|
CROSSREFS
|
Solutions to 13^n == k (mod n): A015963 (k=-1), A116621 (k=1), this sequence (k=2), A116629 (k=3), A116630 (k=4), A116611 (k=5), A116631 (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620 (k=10), A116638 (k=11), A116639 (k=15).
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Term a(1)=1 is prepended and a(7)-a(8) are added by Max Alekseyev, Jun 29 2011
|
|
STATUS
|
approved
|
|
|
|