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

%I #10 Jun 15 2018 21:27:53

%S 0,1,0,1,4,3,2,1,0,1,9,9,9,11,9,1,9,9,9,1,15,15,9,9,24,3,0,9,9,21,9,1,

%T 3,13,4,9,9,5,27,1,9,15,9,5,9,35,9,33,30,1,15,9,9,27,34,25,45,23,9,21,

%U 9,19,36,1,29,9,9,33,39,51,9,9,9,7,24,25,4,27,9,1

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

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

%p seq(irem(9^n,n),n=1..80); # _Zerinvary Lajos_, Apr 20 2008

%t Table[PowerMod[9, n, n], {n, 80} ]

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

%K nonn

%O 1,5

%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 March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)