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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 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
 2, 23, 11, 7, 10, 19, 57, 17, 14, 15, 614, 13, 34 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(14) > 10^15. - Max Alekseyev, Apr 14 2012 LINKS Fausto A. C. Cariboni, Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found, Oct 30 2016 [With 182 new terms, this supersedes the earlier table from Robert G. Wilson v] MATHEMATICA 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 *) CROSSREFS Cf. A128361, A128362, A128363, A128364, A128366, A128367, A128368, A128369, A129370, A128371, A128372. Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160. Cf. A128149, A128150, A128172. Sequence in context: A237579 A104644 A158992 * A326954 A153654 A153656 Adjacent sequences: A128362 A128363 A128364 * A128366 A128367 A128368 KEYWORD hard,more,nonn AUTHOR Alexander Adamchuk, Feb 27 2007 STATUS approved

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.

Last modified December 10 02:09 EST 2022. Contains 358712 sequences. (Running on oeis4.)