The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119714 a(n) is the least k such that the remainder when 8^k is divided by k is n. 46
 7, 3, 5, 6, 39, 58, 7342733, 9, 36196439, 18, 501, 26, 13607, 249, 119, 20, 33, 25, 866401, 22, 533, 35, 185, 50, 196673, 27, 1843, 36, 69, 34, 551, 55, 3773365, 110, 159, 116, 355, 237, 8401, 52, 471, 81815, 85, 261, 11783479, 3258, 93, 92, 1885511821439 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(61) = 1802190094793 = 11 * 59 * 17839 * 155663. - Hagen von Eitzen, Jul 28 2009 LINKS MATHEMATICA Do[k = 1; While[PowerMod[8, k, k] != n, k++ ]; Print[k], {n, 48}] t = Table[0, {10000}]; k = 1; lst = {}; While[k < 4300000000, a = PowerMod[8, k, k]; If[ a<10001 && t[[a]]==0, t[[a]]=k; Print[{a, k}]]; k++ ]; t (* Mathematica coding extended to reflect the new search limits as posted in the a-file by Robert G. Wilson v, Jul 17 2009 *) CROSSREFS Cf. A036236, A078457, A119678, A119679, A127816, A119715, A127817, A127818, A127819, A127820, A127821. Sequence in context: A155987 A200279 A213085 * A154889 A135002 A319531 Adjacent sequences: A119711 A119712 A119713 * A119715 A119716 A119717 KEYWORD hard,nonn AUTHOR Ryan Propper, Jun 12 2006 EXTENSIONS a(49) from Hagen von Eitzen, Jul 24 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 01:51 EST 2022. Contains 358649 sequences. (Running on oeis4.)