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!)
A070654 a(n) = n^6 mod 31. 0
0, 1, 2, 16, 4, 1, 1, 4, 8, 8, 2, 4, 2, 16, 8, 16, 16, 8, 16, 2, 4, 2, 8, 8, 4, 1, 1, 4, 16, 2, 1, 0, 1, 2, 16, 4, 1, 1, 4, 8, 8, 2, 4, 2, 16, 8, 16, 16, 8, 16, 2, 4, 2, 8, 8, 4, 1, 1, 4, 16, 2, 1, 0, 1, 2, 16, 4, 1, 1, 4, 8, 8, 2, 4, 2, 16, 8, 16, 16, 8, 16, 2, 4, 2, 8, 8, 4, 1, 1, 4, 16, 2, 1, 0, 1, 2 (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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-31). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 100], 6, 31] (* Harvey P. Dale, May 19 2021 *)
PROG
(Sage) [power_mod(n, 6, 31)for n in range(0, 96)] # Zerinvary Lajos, Nov 07 2009
(PARI) a(n)=n^6%31 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A141239 A303990 A095860 * A036164 A076536 A110009
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 16 17:36 EDT 2024. Contains 371749 sequences. (Running on oeis4.)