|
|
A127819
|
|
a(n) = least k such that the remainder when 11^k is divided by k is n.
|
|
38
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
t = Table[0, {10000} ]; k = 1; While[ k < 4300000000, a = PowerMod[11, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
f[n_]:=Module[{k=1}, While[PowerMod[11, k, k]!=n, k++]; k]; Array[f, 51] (* Harvey P. Dale, Mar 12 2013 *)
|
|
CROSSREFS
|
Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127820, A127821.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(52) from Max Alekseyev & Joe K. Crump (joecr(AT)carolina.rr.com), Feb 06 2007
a(108), a(514), a(754), a(808), a(820), a(880), a(934), a(948) added by Daniel Morel, May 18 2010, Jun 17 2010
|
|
STATUS
|
approved
|
|
|
|