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!)
A070664 a(n) = n^6 mod 41. 0
0, 1, 23, 32, 37, 4, 39, 20, 31, 40, 10, 33, 36, 2, 9, 5, 16, 8, 18, 21, 25, 25, 21, 18, 8, 16, 5, 9, 2, 36, 33, 10, 40, 31, 20, 39, 4, 37, 32, 23, 1, 0, 1, 23, 32, 37, 4, 39, 20, 31, 40, 10, 33, 36, 2, 9, 5, 16, 8, 18, 21, 25, 25, 21, 18, 8, 16, 5, 9, 2, 36, 33, 10, 40, 31, 20, 39, 4 (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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-41). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 80], 6, 41] (* Harvey P. Dale, Feb 14 2016 *)
PROG
(Sage) [power_mod(n, 6, 41)for n in range(0, 78)] # - Zerinvary Lajos, Nov 07 2009
(PARI) a(n)=n^6%41 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A130825 A087563 A093477 * A243907 A096083 A112687
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 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)