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

A070535
a(n) = n^4 mod 18.
1
0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1, 0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1, 0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1, 0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1, 0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1
OFFSET
0,3
COMMENTS
Equivalently: n^(6*m+4) mod 18. - G. C. Greubel, Apr 05 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, 1).
FORMULA
From G. C. Greubel, Apr 05 2016: (Start)
a(6*n) = 0.
a(n+18) = a(n). (End)
MATHEMATICA
PowerMod[Range[0, 100], 4, 18] (* G. C. Greubel, Apr 05 2016 *)
PadRight[{}, 120, {0, 1, 16, 9, 4, 13, 0, 7, 10, 9, 10, 7, 0, 13, 4, 9, 16, 1}] (* Harvey P. Dale, Mar 01 2023 *)
PROG
(Sage) [power_mod(n, 4, 18)for n in range(0, 90)] # Zerinvary Lajos, Oct 31 2009
(PARI) a(n)=n^4%18 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A164703 A153724 A183396 * A070579 A278829 A066905
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved