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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128372 a(n) = least k such that the remainder when 32^k is divided by k is n. 25

%I #9 Jul 31 2015 20:46:53

%S 31,3,29,6,201,13,25,9,23,11,183,22,19,159,17,20,45,49,169,502,209,42,

%T 35,50,91919,27,3265,36,1159,98,75197,33,95,66,2817,38,1385,58,25187,

%U 82,32727,982,55,117,7031,91,2517,52,46528545441593,57,503981,92,135,194

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

%C Values a(50), ..., a(149) are relatively small again (starting 57, 503981, 92, 135, 194, 576353, 87, 125, 1902, 6019, 323, 43335727, 69, ...). - _Hagen von Eitzen_, Jun 04 2009

%H Robert G. Wilson v, <a href="/A128372/a128372.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[32, 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, A129369, A128370, A128371. 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

%E Incorrect comment removed by _Hagen von Eitzen_, Jul 19 2009

%E a(49) found by _Hagen von Eitzen_, Jul 20 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 02:34 EDT 2024. Contains 372203 sequences. (Running on oeis4.)