|
Search: id:A127817
|
|
|
| A127817 |
|
a(n) = least k such that the remainder when 9^k is divided by k is n. |
|
+0
35
|
| |
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
Do[k = 1; While[ k<10^6 && PowerMod[9, k, k] != n, k++ ]; Print[{n, k}], {n, 1, 100}]
t = Table[0, {1000} ]; k = 1; While[ k < 200000000, a = PowerMod[9, 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, A127818, A127819, A127820, A127821.
Sequence in context: A074067 A110988 A047224 this_sequence A047232 A103557 A138283
Adjacent sequences: A127814 A127815 A127816 this_sequence A127818 A127819 A127820
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 30 2007
|
|
EXTENSIONS
|
a(8) <= 2592842671511 from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 06 2007
|
|
|
Search completed in 0.002 seconds
|
