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