This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070692 a(n) = n^7 mod 9. 0
 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1, 2, 0, 4, 5, 0, 7, 8, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS MATHEMATICA PowerMod[Range[0, 100], 7, 9] (* or *) PadRight[{}, 101, {0, 1, 2, 0, 4, 5, 0, 7, 8}] (* Harvey P. Dale, May 29 2013 *) PROG (Sage) [power_mod(n, 7, 9) for n in xrange(101)] # Zerinvary Lajos, Nov 07 2009 (PARI) a(n)=n^7%9 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A300307 A286606 A266587 * A162397 A091684 A100050 Adjacent sequences:  A070689 A070690 A070691 * A070693 A070694 A070695 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 17:24 EDT 2018. Contains 316392 sequences. (Running on oeis4.)