|
|
A116631
|
|
Positive integers n such that 13^n == 6 (mod n).
|
|
14
|
|
|
1, 7, 8743, 50239, 312389, 8789977, 87453889, 96301009, 3963715129, 5062673539, 6854133309107, 16987071590111, 72278468169733, 411419589731633, 590475819370933
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
No other terms below 10^15. A large term: 2455610470454186971078168169. - Max Alekseyev, Dec 19 2017
|
|
LINKS
|
|
|
MATHEMATICA
|
Join[{1}, Select[Range[1, 9000], Mod[13^#, #] == 6 &]] (* G. C. Greubel, Nov 19 2017 *)
Join[{1}, Select[Range[10000000], PowerMod[13, #, #] == 6 &]] (* Robert Price, Apr 10 2020 *)
|
|
PROG
|
(PARI) isok(n) = Mod(13, n)^n == 6; \\ Michel Marcus, Nov 19 2017
|
|
CROSSREFS
|
Solutions to 13^n == k (mod n): A001022 (k=0), A015963 (k=-1), A116621 (k=1), A116622 (k=2), A116629 (k=3), A116630 (k=4), A116611 (k=5), this sequence (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620(k=10), A116638 (k=11), A116639 (k=15).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Term 1 is prepended and a(11)-a(15) added by Max Alekseyev, Jun 29 2011, Dec 19 2017
|
|
STATUS
|
approved
|
|
|
|