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!)
A066431 a(n) = 9^n mod n^9. 1

%I #10 May 30 2022 21:05:32

%S 0,81,729,6561,59049,531441,4782969,43046721,0,486784401,727739626,

%T 3801397473,7390478182,5013665073,26942641524,68218142337,50040016962,

%U 127461340881,20157955560,179056928801,95734214766,798384194161

%N a(n) = 9^n mod n^9.

%H Harry J. Smith, <a href="/A066431/b066431.txt">Table of n, a(n) for n = 1..500</a>

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

%t Table[PowerMod[9,n,n^9],{n,30}] (* _Harvey P. Dale_, May 30 2022 *)

%o (PARI) { for (n=1, 500, write("b066431.txt", n, " ", 9^n % n^9) ) } \\ _Harry J. Smith_, Feb 13 2010

%K nonn

%O 1,2

%A _Robert G. Wilson v_, Dec 27 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 10:46 EDT 2024. Contains 371779 sequences. (Running on oeis4.)