The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128154 a(n) = least k such that the remainder when 14^k is divided by k is n. 34
 13, 3, 11, 5, 33, 10, 1967, 9, 23587, 18, 2733, 46, 17651, 15, 93929, 20, 303, 178, 145, 22, 12901, 58, 2721, 25, 17990951, 27, 143, 36, 85, 166, 646123, 82, 2439143677, 55, 63, 76, 319, 123, 295, 52, 51, 77, 247380287953, 45, 5779134947, 90, 87, 74, 175, 146 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA t = Table[0, {10000} ]; k = 1; While[ k < 3000000000, a = PowerMod[14, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t lk[n_]:=Module[{k=1}, While[PowerMod[14, k, k]!=n, k++]; k]; Array[lk, 20] (* Harvey P. Dale, Aug 17 2013 *) CROSSREFS Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128155, A128156, A128157, A128158, A128159, A128160, A128149, A128150. Sequence in context: A117540 A010221 A113172 * A213538 A264971 A107806 Adjacent sequences:  A128151 A128152 A128153 * A128155 A128156 A128157 KEYWORD hard,nonn AUTHOR Alexander Adamchuk, Feb 16 2007 EXTENSIONS More terms from Ryan Propper, Feb 28 2007 a(43) from Hagen von Eitzen, Aug 16 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 29 08:46 EDT 2021. Contains 346340 sequences. (Running on oeis4.)