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

A070551
a(n) = n^4 mod 23.
1
0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3
OFFSET
0,3
COMMENTS
Equivalently: n^(22*m + 4) mod 23. - G. C. Greubel, Apr 06 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, 0, 0, 0, 0, 0, 1).
FORMULA
From G. C. Greubel, Apr 06 2016: (Start)
a(23*n) = 0.
a(n+23) = a(n). (End)
MATHEMATICA
PowerMod[Range[0, 90], 4, 23] (* Harvey P. Dale, Feb 25 2015 *)
PROG
(Sage) [power_mod(n, 4, 23)for n in range(0, 89)] # Zerinvary Lajos, Oct 31 2009
(PARI) a(n)=n^4%23 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A028695 A008665 A076823 * A028493 A291426 A299524
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved