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

A070646
a(n) = n^6 mod 23.
0
0, 1, 18, 16, 2, 8, 12, 4, 13, 3, 6, 9, 9, 6, 3, 13, 4, 12, 8, 2, 16, 18, 1, 0, 1, 18, 16, 2, 8, 12, 4, 13, 3, 6, 9, 9, 6, 3, 13, 4, 12, 8, 2, 16, 18, 1, 0, 1, 18, 16, 2, 8, 12, 4, 13, 3, 6, 9, 9, 6, 3, 13, 4, 12, 8, 2, 16, 18, 1, 0, 1, 18, 16, 2, 8, 12, 4, 13, 3, 6, 9, 9, 6, 3, 13, 4, 12, 8, 2
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, 1).
FORMULA
a(n) = a(n-23). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 90], 6, 23] (* or *) PadRight[{}, 90, {0, 1, 18, 16, 2, 8, 12, 4, 13, 3, 6, 9, 9, 6, 3, 13, 4, 12, 8, 2, 16, 18, 1}] (* Harvey P. Dale, Jul 18 2021 *)
PROG
(Sage) [power_mod(n, 6, 23)for n in range(0, 89)] # Zerinvary Lajos, Nov 06 2009
(PARI) a(n)=n^6%23 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A298723 A299557 A079293 * A375676 A094381 A375675
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved