|
Search: id:A127819
|
|
|
| A127819 |
|
a(n) = least k such that the remainder when 11^k is divided by k is n. |
|
+0
35
|
|
| 2, 3, 118, 7, 39, 155, 38, 9, 14, 18659, 13, 8153, 92, 1317, 106, 35, 26, 49, 34, 57, 68, 253, 327, 1271, 28, 27, 94, 1633, 46, 161, 415, 1141, 44, 909589, 86, 161015, 119, 1293, 82, 673279, 129, 577679, 4578, 77, 164, 65, 74, 3589, 76, 147, 115
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
Do[k = 1; While[ k<10^6 && PowerMod[11, k, k] != n, k++ ]; Print[{n, k}], {n, 1, 100}]
t = Table[0, {1000} ]; k = 1; While[ k < 200000000, a = PowerMod[11, 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, A127820, A127821.
Adjacent sequences: A127816 A127817 A127818 this_sequence A127820 A127821 A127822
Sequence in context: A114373 A117700 A084755 this_sequence A102697 A041813 A065842
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 30 2007
|
|
EXTENSIONS
|
a(52) <= 27041811961 from Max Alekseyev (maxal(AT)cs.ucsd.edu), Feb 06 2007 & from Joe K. Crump (joecr(AT)carolina.rr.com), Feb 06 2007
|
|
|
Search completed in 0.002 seconds
|
