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”).

A127820
a(n) = least k such that the remainder when 12^k is divided by k is n.
38
11, 5, 15, 10, 7, 21, 25, 34, 549, 134, 120593747, 13, 20395, 26, 1713, 20, 203, 57, 49, 62, 1707, 122, 55, 30, 793, 118, 45, 58, 1921, 38, 1853, 56, 339, 110, 4223, 42, 85, 106, 1689, 52, 841, 642, 4475, 70, 51, 551, 11683, 147, 168061, 94, 129, 623, 1243895, 90
OFFSET
1,1
MATHEMATICA
t = Table[0, {10000} ]; k = 1; While[ k < 3000000000, a = PowerMod[12, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Aug 04 2009 *)
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Jan 30 2007
EXTENSIONS
More terms from Robert G. Wilson v, Feb 06 2007
STATUS
approved