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!)
A070693 a(n) = n^7 mod 11. 0
0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 10, 0, 1, 7, 9, 5, 3, 8, 6, 2, 4, 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, 1).
MATHEMATICA
PowerMod[Range[0, 100], 7, 11] (* Harvey P. Dale, Sep 17 2013 *)
PROG
(Sage) [power_mod(n, 7, 11) for n in range(99)] # - Zerinvary Lajos, Jun 12 2009
(PARI) a(n)=n^7%11 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A021561 A216104 A093206 * A369095 A198417 A363687
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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)