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!)
A066609 a(n) = remainder when 5^n is divided by n^5. 1

%I #10 Jul 05 2023 10:42:26

%S 0,25,125,625,0,73,10897,30177,4508,65625,29672,36433,263034,288873,

%T 575000,159681,592030,1485433,1639363,1240625,250928,928073,4040001,

%U 93601,0,10915033,14288075,16048657,3176520,4515625

%N a(n) = remainder when 5^n is divided by n^5.

%H Harry J. Smith, <a href="/A066609/b066609.txt">Table of n, a(n) for n = 1..1000</a>

%e a(6) = 73 as 5^6 = 15625 = (6^5)*2 + 73.

%t Table[ Mod[5^n, n^5], {n, 1, 30} ]

%t Table[PowerMod[5,n,n^5],{n,30}] (* _Harvey P. Dale_, Jul 05 2023 *)

%o (PARI) { for (n=1, 1000, write("b066609.txt", n, " ", 5^n % n^5) ) } \\ _Harry J. Smith_, Mar 11 2010

%K nonn

%O 1,2

%A _Amarnath Murthy_, Dec 24 2001

%E More terms from _Robert G. Wilson v_, Dec 26 2001

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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)