# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a119714
Showing 1-1 of 1

%I A119714 #17 Jul 24 2021 09:52:00
%S A119714 7,3,5,6,39,58,7342733,9,36196439,18,501,26,13607,249,119,20,33,25,
%T A119714 866401,22,533,35,185,50,196673,27,1843,36,69,34,551,55,3773365,110,
%U A119714 159,116,355,237,8401,52,471,81815,85,261,11783479,3258,93,92,1885511821439
%N A119714 a(n) is the least k such that the remainder when 8^k is divided by k is n.
%C A119714 a(61) = 1802190094793 = 11 * 59 * 17839 * 155663. - _Hagen von Eitzen_, Jul 28 2009
%H A119714 Robert G. Wilson v, <a href="/A119714/a119714.txt">Table of n, a(n) for n = 1..10000 with -1 for those entries where a(n) has not yet been found</a>
%t A119714 Do[k = 1; While[PowerMod[8, k, k] != n, k++ ]; Print[k], {n, 48}]
%t A119714 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 *)
%Y A119714 Cf. A036236, A078457, A119678, A119679, A127816, A119715, A127817, A127818, A127819, A127820, A127821.
%K A119714 hard,nonn
%O A119714 1,1
%A A119714 _Ryan Propper_, Jun 12 2006
%E A119714 a(49) from _Hagen von Eitzen_, Jul 24 2009

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE