The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A070616 a(n) = n^5 mod 33. 1
0, 1, 32, 12, 1, 23, 21, 10, 32, 12, 10, 11, 12, 10, 23, 12, 1, 32, 21, 10, 23, 21, 22, 23, 21, 1, 23, 12, 10, 32, 21, 1, 32, 0, 1, 32, 12, 1, 23, 21, 10, 32, 12, 10, 11, 12, 10, 23, 12, 1, 32, 21, 10, 23, 21, 22, 23, 21, 1, 23, 12, 10, 32, 21, 1, 32, 0, 1, 32, 12, 1, 23, 21, 10 (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, 1).
FORMULA
a(n) = a(n-33). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 120], 5, 33] (* Harvey P. Dale, Mar 20 2011 *)
PROG
(Sage) [power_mod(n, 5, 33)for n in range(0, 74)] # Zerinvary Lajos, Nov 04 2009
(PARI) a(n)=n^5%33 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A303088 A302893 A303628 * A079809 A070629 A304228
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 May 26 22:41 EDT 2024. Contains 372847 sequences. (Running on oeis4.)