This site is supported by donations to The OEIS Foundation.

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

%I

%S 3,7,13,6,11,10,87,62,209,18,35,122,4083,22,16584420001,17,1343851,34,

%T 453,44,215,26,469,58,69,46,121,36,266461,49,813,56,19499,74,58501,

%U 230,123,218,2077,78,17845,214,579,106,24313642489,90,6541,88,57,206

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

%H Robert G. Wilson v, <a href="/A128156/a128156.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 < 4100000000, a = PowerMod[16, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t

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

%K hard,nonn

%O 1,1

%A _Alexander Adamchuk_, Feb 16 2007

%E More terms from Ryan Propper (rpropper(AT)stanford.edu), Feb 27 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .