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”).

A167129
n^7 mod 21.
0
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20
OFFSET
0,3
COMMENTS
Equivalently: n^(6*m+7) mod 21. - G. C. Greubel, Jun 04 2016
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-21). - R. J. Mathar, Sep 30 2013
MATHEMATICA
PowerMod[Range[0, 90], 7, 21] (* or *) PadRight[{}, 90, Range[0, 20]] (* Harvey P. Dale, Apr 21 2012 *)
PROG
(Sage) [power_mod(n, 7, 21)for n in range(0, 85)] #
(PARI) a(n)=n^7%21 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A121761 A056963 A291769 * A348287 A328447 A107602
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Oct 28 2009
STATUS
approved