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!)
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
Sequence in context: A237579 A104644 A158992 * A326954 A153654 A153656
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 21:02 EDT 2024. Contains 370951 sequences. (Running on oeis4.)