A116639
Numbers n such that 13^n == 15 (mod n).
Original entry on oeis.org
1, 2, 14, 22, 1582, 11266, 52766, 76202, 100562, 494371, 641141, 1698494, 66593158, 469296521, 10917186079, 12062558662, 4928050067287, 5315948729617, 29841213777637, 113215787397262, 778590786358582, 787324867879046
Offset: 1
Cf.
A116609,
A116611,
A116620,
A116621,
A116622,
A116629,
A116630,
A116631,
A116632,
A116636,
A116638.
-
Select[Range[25000000],PowerMod[13,#,# ]==15&] (* Harvey P. Dale, Feb 03 2009 *)
a(14)-a(22) from
Max Alekseyev, May 04 2010, Apr 29 2014, Oct 15 2016
A295532
Positive integers n such that 13^n == 8 (mod n).
Original entry on oeis.org
1, 5, 371285, 3957661, 70348567451, 42831939409247
Offset: 1
Sequences 13^n == k (mod n):
A116621 (k=1),
A116622 (k=2),
A116629 (k=3),
A116630 (k=4),
A116611 (k=5),
A116631 (k=6),
A116632 (k=7), this sequence (k=8),
A116636 (k=9),
A116620 (k=10),
A116638 (k=11),
A116639 (k=15).
-
Join[{1, 5}, Select[Range[4000000], PowerMod[13, #, #] == 8 &]] (* Robert Price, Apr 10 2020 *)
A321364
Positive integers m such that 13^m == 12 (mod m).
Original entry on oeis.org
1, 13757837, 6969969233, 514208575135
Offset: 1
Solutions to 13^m == k (mod m):
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),
A116638 (k=11), this sequence (k=12),
A321365 (k=14),
A116639 (k=15).
A321365
Positive integers n such that 13^n == 14 (mod n).
Original entry on oeis.org
1, 5805311, 392908759, 399614833907, 2674764845549, 21997277871211, 67146783889057
Offset: 1
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),
A116638 (k=11),
A321364 (k=12), this sequence (k=14),
A116639 (k=15).
A333413
Positive integers k such that k divides 13^k + 2.
Original entry on oeis.org
1, 3, 5, 185, 2199, 14061, 5672119, 6719547, 192178873, 913591893, 4589621727, 9762178659, 1157052555699
Offset: 1
Solutions to 13^k == m (mod k): this sequence (m = -2),
A015963 (m = -1),
A116621 (m = 1),
A116622 (m = 2),
A116629 (m = 3),
A116630 (m = 4),
A116611 (m = 5),
A116631 (m = 6),
A116632 (m = 7),
A295532 (m = 8),
A116636 (m = 9),
A116620 (m = 10),
A116638 (m = 11),
A116639 (k = 15).
-
Select[Range[100000], Divisible[PowerMod[13, #, #] + 2, #] &] (* Jinyuan Wang, Mar 28 2020 *)
-
for(k=1, 1e6, if(Mod(13, k)^k==-2, print1(k", ")))
Comments