(Translated by https://www.hiragana.jp/)
A070642 - OEIS
login
A070642
a(n) = n^6 mod 19.
0
0, 1, 7, 7, 11, 7, 11, 1, 1, 11, 11, 1, 1, 11, 7, 11, 7, 7, 1, 0, 1, 7, 7, 11, 7, 11, 1, 1, 11, 11, 1, 1, 11, 7, 11, 7, 7, 1, 0, 1, 7, 7, 11, 7, 11, 1, 1, 11, 11, 1, 1, 11, 7, 11, 7, 7, 1, 0, 1, 7, 7, 11, 7, 11, 1, 1, 11, 11, 1, 1, 11, 7, 11, 7, 7, 1, 0, 1, 7, 7, 11, 7, 11, 1, 1, 11, 11, 1, 1, 11
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, 1).
FORMULA
a(n) = a(n-19). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 100], 6, 19] (* Wesley Ivan Hurt, Dec 26 2023 *)
PROG
(Sage) [power_mod(n, 6, 19)for n in range(0, 90)] # Zerinvary Lajos, Nov 06 2009
(PARI) a(n)=n^6%19 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A103569 A306530 A094460 * A064496 A084513 A084523
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved