来自在线整数百科全书的问候语!http://oei.org/y*搜索:ID:A116638=1-1,其中1AI为A116638,S A116638,1,2158181861061609660584667 10875 82634 1628 818307,% %T A116638 16205558969πN A116638正整数N,使得13 ^ n=11(mod n)。% %C A116638没有其他条件低于10 ^ 15。- _Max Alekseyev_, Nov 07 2018 %C A116638 Large terms: 38763675625170712166, 527929122195463909516681113715859203. %t A116638 Join[{1, 2}, Select[Range[1, 9000], Mod[13^#, #] == 11 &]] (* _G. C. Greubel_, Nov 20 2017 *) %Y A116638 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), A116631 (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620 (k=10), this sequence (k=11), A116639 (k=15). %Y A116638 Cf. A116609. %K A116638 more,nonn %O A116638 1,2 %A A116638 _Zak Seidov_, Feb 19 2006 %E A116638 More terms from _Ryan Propper_, Jan 11 2008 %E A116638 Edited by _Max Alekseyev_, May 04 2010 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE