login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
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 *)
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Jan 30 2007
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
a-file updated by Max Alekseyev, Dec 10 2010
a(112), a(348), a(810) added by Daniel Morel, Mar 12 2015
STATUS
approved