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!)
A070634 a(n) = n^6 mod 11. 0
0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1, 9, 3, 4, 5, 5, 4, 3, 9, 1, 0, 1 (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, 1).
FORMULA
a(n) = a(n-11). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 100], 6, 11] (* Wesley Ivan Hurt, Dec 26 2023 *)
PROG
(Sage) [power_mod(n, 6, 11)for n in range(0, 101)] # Zerinvary Lajos, Jun 12 2009
(PARI) a(n)=n^6%11 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A021521 A011011 A236100 * A273017 A222233 A021111
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 14 20:17 EDT 2024. Contains 372533 sequences. (Running on oeis4.)