login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,3
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 range(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
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved