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

%I #18 Jun 15 2018 21:28:12

%S 0,1,1,1,2,1,0,1,1,9,7,1,7,7,13,1,7,1,7,1,7,5,7,1,7,23,1,21,7,19,7,1,

%T 13,15,28,1,7,11,31,1,7,7,7,25,37,3,7,1,0,49,37,9,7,1,43,49,1,49,7,1,

%U 7,49,28,1,37,37,7,21,67,49,7,1,7,49,43,45,28,25,7,1

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

%H Harry J. Smith and Seiichi Manyama, <a href="/A066438/b066438.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)

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

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

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

%Y Cf. k^n mod n; A015910 (k=2), A066601 (k=3), A066602 (k=4), A066603 (k=5), A066604 (k=6), this sequence (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).

%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 April 20 03:59 EDT 2024. Contains 371798 sequences. (Running on oeis4.)