The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070695 a(n) = n^7 mod 13. 0
 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1, 11, 3, 4, 8, 7, 6, 5, 9, 10, 2, 12, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS MATHEMATICA PowerMod[Range[0, 100], 7, 13] (* Harvey P. Dale, Jan 19 2016 *) PROG (Sage) [power_mod(n, 7, 13) for n in range(93)] # Zerinvary Lajos, Oct 28 2009 (PARI) a(n)=n^7%13 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A110089 A177415 A208091 * A070720 A010189 A338716 Adjacent sequences:  A070692 A070693 A070694 * A070696 A070697 A070698 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 13 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 00:17 EDT 2021. Contains 345080 sequences. (Running on oeis4.)