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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066603 a(n) = 5^n mod n. 9
 0, 1, 2, 1, 0, 1, 5, 1, 8, 5, 5, 1, 5, 11, 5, 1, 5, 1, 5, 5, 20, 3, 5, 1, 0, 25, 26, 9, 5, 25, 5, 1, 26, 25, 10, 1, 5, 25, 8, 25, 5, 1, 5, 9, 35, 25, 5, 1, 19, 25, 23, 1, 5, 1, 45, 25, 11, 25, 5, 25, 5, 25, 62, 1, 5, 49, 5, 13, 56, 65, 5, 1, 5, 25, 50, 17, 3, 25, 5, 65, 80, 25, 5, 1, 65 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Harry J. Smith and Seiichi Manyama, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith) EXAMPLE a(7) = 5 as 5^7 = 78125 = 7*11160 + 5. MAPLE seq(irem(5^n, n), n=1..85); # Zerinvary Lajos, Apr 20 2008 MATHEMATICA Table[PowerMod[5, n, n], {n, 85} ] PROG (PARI) { for (n=1, 1000, write("b066603.txt", n, " ", 5^n % n) ) } \\ Harry J. Smith, Mar 09 2010 CROSSREFS Cf. k^n mod n: A015910 (k=2), A066601 (k=3), A066602 (k=4), this sequence (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13). Sequence in context: A210872 A292973 A220235 * A263339 A244372 A119331 Adjacent sequences: A066600 A066601 A066602 * A066604 A066605 A066606 KEYWORD easy,nonn AUTHOR Amarnath Murthy, Dec 22 2001 EXTENSIONS More terms from Robert G. Wilson v, Dec 27 2001 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 January 27 02:41 EST 2023. Contains 359836 sequences. (Running on oeis4.)