login
This site is supported by donations 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

Table of n, a(n) for n=0..98.

MATHEMATICA

PowerMod[Range[0, 100], 7, 11] (* Harvey P. Dale, Sep 17 2013 *)

PROG

(Sage) [power_mod(n, 7, 11) for n in xrange(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 * A198417 A215736 A132715

Adjacent sequences:  A070690 A070691 A070692 * A070694 A070695 A070696

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 15:14 EDT 2019. Contains 328030 sequences. (Running on oeis4.)