|
Search: id:A127821
|
|
|
| A127821 |
|
a(n) = least k such that the remainder when 13^k is divided by k is n. |
|
+0
35
|
|
| 2, 11, 5, 51, 44, 7, 15, 371285, 10, 74853, 158, 13757837, 17, 5805311, 22, 2181, 38, 25, 30, 9667, 74, 87, 146, 23441, 88, 19629779, 35, 45, 70, 235433, 46, 55, 34, 309, 134
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Robert G. Wilson v, Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found
|
|
MATHEMATICA
|
t = Table[0, {10000} ]; k = 1; While[ k < 3500000000, a = PowerMod[13, k, k]; If[a < 1001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
|
|
CROSSREFS
|
Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820.
Adjacent sequences: A127818 A127819 A127820 this_sequence A127822 A127823 A127824
Sequence in context: A087552 A124688 A158616 this_sequence A114724 A165768 A009258
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 30 2007
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Feb 06 2007
a(54) <= 47941814519 from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 09 2007
|
|
|
Search completed in 0.002 seconds
|
