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

A070573
a(n) = n^4 mod 30.
0
0, 1, 16, 21, 16, 25, 6, 1, 16, 21, 10, 1, 6, 1, 16, 15, 16, 1, 6, 1, 10, 21, 16, 1, 6, 25, 16, 21, 16, 1, 0, 1, 16, 21, 16, 25, 6, 1, 16, 21, 10, 1, 6, 1, 16, 15, 16, 1, 6, 1, 10, 21, 16, 1, 6, 25, 16, 21, 16, 1, 0, 1, 16, 21, 16, 25, 6, 1, 16, 21, 10, 1, 6, 1, 16, 15, 16, 1, 6, 1, 10
OFFSET
0,3
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
MATHEMATICA
PowerMod[Range[0, 80], 4, 30] (* Harvey P. Dale, Jul 14 2019 *)
PROG
(Sage) [power_mod(n, 4, 30)for n in range(0, 81)] # - Zerinvary Lajos, Oct 31 2009
(PARI) a(n)=n^4%30 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A045658 A167305 A094329 * A186462 A205098 A290142
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved