login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)