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!)
 A128369 a(n) = least k such that the remainder when 29^k is divided by k is n. 14

%I

%S 2,3,13,5,22,23,11,9,26,19,51,17,46,15,118,178523,152,92634008921,102,

%T 24369,82,2873,93,25,34,27,74,11227,31,39259,830,69,136,817,62,2429,

%U 66,24351,802,121,184,3405997613,714,45,398,5846879,794,221,114

%N a(n) = least k such that the remainder when 29^k is divided by k is n.

%C a(408) = 9848641373 = 60343 * 163211.

%C a(756) = 10012502599 = 11 * 19 * 47906711.

%C a(886) = 12256265747, a(966) = 10085567837. - _Daniel Morel_, Jun 08 2010

%C a(378) = 31113438371, a(492) = 18377996647, a(730) = 22778710711. - _Daniel Morel_, Jul 05 2010

%C a(802) = 20290196677, a(826) = 21466370573. - _Daniel Morel_, Aug 24 2010

%H Robert G. Wilson v, <a href="/A128369/a128369.txt">Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found</a>

%t t = Table[0, {10000} ]; k = 1; While[ k < 4000000000, a = PowerMod[29, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* _Robert G. Wilson v_, Aug 06 2009 *)

%Y Cf. A128361, A128362, A128363, A128364, A128365, A128366, A128367, A128368, A129370, A128371, A128372.

%Y Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160.

%Y Cf. A128149, A128150, A128172.

%K hard,nonn

%O 1,1

%A _Alexander Adamchuk_, Feb 27 2007

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 September 25 23:23 EDT 2020. Contains 337346 sequences. (Running on oeis4.)