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

A070609
a(n) = n^5 mod 25.
1
0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1, 7, 18, 24, 0, 1
OFFSET
0,3
COMMENTS
Period 5: repeat [0, 1, 7, 18, 24]. - Jianing Song, Apr 06 2019
FORMULA
From Colin Barker, Apr 06 2019: (Start)
G.f.: x*(1 + 4*x)*(1 + 3*x + 6*x^2) / ((1 - x)*(1 + x + x^2 + x^3 + x^4)).
a(n) = a(n-5) for n>4.
(End)
PROG
(Sage) [power_mod(n, 5, 25)for n in range(0, 87)] # - Zerinvary Lajos, Nov 04 2009
(PARI) a(n)=n^5%25 \\ Charles R Greathouse IV, Apr 06 2016
(PARI) concat(0, Vec(x*(1 + 4*x)*(1 + 3*x + 6*x^2) / ((1 - x)*(1 + x + x^2 + x^3 + x^4)) + O(x^80))) \\ Colin Barker, Apr 06 2019
CROSSREFS
Sequence in context: A374460 A256011 A272972 * A007236 A056021 A090098
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved