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!)
A070645 a(n) = n^6 mod 22. 0
0, 1, 20, 3, 4, 5, 16, 15, 14, 9, 12, 11, 12, 9, 14, 15, 16, 5, 4, 3, 20, 1, 0, 1, 20, 3, 4, 5, 16, 15, 14, 9, 12, 11, 12, 9, 14, 15, 16, 5, 4, 3, 20, 1, 0, 1, 20, 3, 4, 5, 16, 15, 14, 9, 12, 11, 12, 9, 14, 15, 16, 5, 4, 3, 20, 1, 0, 1, 20, 3, 4, 5, 16, 15, 14, 9, 12, 11, 12, 9, 14, 15 (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, 1).
FORMULA
a(n) = a(n-22). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 90], 6, 22] (* Harvey P. Dale, Aug 24 2013 *)
PROG
(Sage) [power_mod(n, 6, 22)for n in range(0, 82)] # - Zerinvary Lajos, Nov 06 2009
(PARI) a(n)=n^6%22 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A255860 A195600 A118295 * A248136 A040392 A317320
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 March 28 14:20 EDT 2024. Contains 371254 sequences. (Running on oeis4.)