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

A119715
a(n) = least k such that the remainder when 7^k is divided by k is n.
40
2, 5, 46, 339, 22, 387497, 11, 535, 10, 111, 38, 8399, 15, 497, 34, 327, 365, 515, 30, 7219931, 28, 321, 26, 223793, 44, 10718597, 242, 35, 2330, 209, 39, 305, 136, 309, 4382, 10596486211, 45, 24751, 7327, 121, 236, 78821, 55, 4117, 76, 1751, 30514339, 83795, 50, 1333
OFFSET
1,1
MATHEMATICA
t = Table[0, {10000}]; k = 1; lst = {}; While[k < 4100000000, a = PowerMod[7, k, k]; If[ a<10001 && t[[a]]==0, t[[a]]=k; Print[{a, k}]]; k++ ]; t (* changed (to reflect the new limits) by Robert G. Wilson v, Jul 17 2009 *)
lk[n_]:=Module[{k=1}, While[PowerMod[7, k, k]!=n, k++]; k]; Array[lk, 50] (* The program will take a long time to run. *) (* Harvey P. Dale, Jan 29 2023 *)
KEYWORD
nonn
AUTHOR
Ryan Propper, Jun 12 2006
EXTENSIONS
a(36) = 10596486211 and later terms from Ryan Propper, Feb 02 2007
STATUS
approved