|
Search: id:A128159
|
|
|
| A128159 |
|
a(n) = least k such that the remainder when 19^k is divided by k is n. |
|
+0
23
|
|
| 2, 17, 358, 5, 7, 13, 118, 11, 22, 207, 14, 6683, 21, 1055, 221, 6843, 86, 39959, 23, 559, 34, 129, 26, 25, 51, 799, 334, 33, 166, 47427581, 1537, 901, 68, 39, 326, 87169, 44, 161, 46, 3509, 341, 529, 106, 1098179, 158, 657, 314, 49621349, 75, 143, 62, 749, 116
(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 < 3100000000, a = PowerMod[19, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t [From Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 04 2009]
|
|
CROSSREFS
|
Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128160. Cf. A128149, A128150.
Sequence in context: A078367 A090306 A007785 this_sequence A085617 A152557 A015202
Adjacent sequences: A128156 A128157 A128158 this_sequence A128160 A128161 A128162
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 16 2007
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Mar 24 2007
I added more terms. Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 04 2009
|
|
|
Search completed in 0.002 seconds
|
