This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128365 a(n) = least k such that the remainder when 25^k is divided by k is n. 17

%I

%S 2,23,11,7,10,19,57,17,14,15,614,13,34

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

%C a(14) > 10^15. - _Max Alekseyev_, Apr 14 2012

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

%H Fausto A. C. Cariboni, <a href="/A128365/a128365_1.txt">Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found</a>, Oct 30 2016 [With 182 new terms, this supersedes the earlier table from Robert G. Wilson v]

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

%Y Cf. A128361, A128362, A128363, A128364, A128366, A128367, A128368, A128369, 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,more,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 May 23 03:02 EDT 2019. Contains 323507 sequences. (Running on oeis4.)