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

A070574
a(n) = n^4 mod 31.
0
0, 1, 16, 19, 8, 5, 25, 14, 4, 20, 18, 9, 28, 10, 7, 2, 2, 7, 10, 28, 9, 18, 20, 4, 14, 25, 5, 8, 19, 16, 1, 0, 1, 16, 19, 8, 5, 25, 14, 4, 20, 18, 9, 28, 10, 7, 2, 2, 7, 10, 28, 9, 18, 20, 4, 14, 25, 5, 8, 19, 16, 1, 0, 1, 16, 19, 8, 5, 25, 14, 4, 20, 18, 9, 28, 10, 7, 2, 2, 7, 10, 28, 9
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, 0, 1).
MATHEMATICA
PowerMod[Range[0, 90], 4, 31] (* Harvey P. Dale, Mar 01 2015 *)
PROG
(Sage) [power_mod(n, 4, 31)for n in range(0, 83)] # - Zerinvary Lajos, Nov 01 2009
(PARI) a(n)=n^4%31 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A358423 A183401 A300142 * A249612 A260560 A034012
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved