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

A070648
a(n) = n^6 mod 25.
0
0, 1, 14, 4, 21, 0, 6, 24, 19, 16, 0, 11, 9, 9, 11, 0, 16, 19, 24, 6, 0, 21, 4, 14, 1, 0, 1, 14, 4, 21, 0, 6, 24, 19, 16, 0, 11, 9, 9, 11, 0, 16, 19, 24, 6, 0, 21, 4, 14, 1, 0, 1, 14, 4, 21, 0, 6, 24, 19, 16, 0, 11, 9, 9, 11, 0, 16, 19, 24, 6, 0, 21, 4, 14, 1, 0, 1, 14, 4, 21, 0, 6, 24, 19
OFFSET
0,3
COMMENTS
Periodic, with period 25: 0, 1, 14, 4, 21, 0, 6, 24, 19, 16, 0, 11, 9, 9, 11, 0, 16, 19, 24, 6, 0, 21, 4, 14, 1. - Harvey P. Dale, Oct 14 2014
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, 1).
FORMULA
a(n) = a(n-25). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 100], 6, 25] (* Harvey P. Dale, Oct 14 2014 *)
PROG
(Sage) [power_mod(n, 6, 25) for n in range(0, 84)] # Zerinvary Lajos, Nov 06 2009
(Magma) [n^6 mod 25: n in [0..80]]; // Vincenzo Librandi, Oct 15 2014
(PARI) a(n)=n^6%25 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A358890 A164811 A018813 * A040188 A322776 A040186
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved