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

%I #15 Dec 19 2023 13:42:18

%S 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,

%T 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,

%U 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

%N a(n) = n^7 mod 11.

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%t PowerMod[Range[0,100],7,11] (* _Harvey P. Dale_, Sep 17 2013 *)

%o (Sage) [power_mod(n,7,11) for n in range(99)] # - _Zerinvary Lajos_, Jun 12 2009

%o (PARI) a(n)=n^7%11 \\ _Charles R Greathouse IV_, Apr 06 2016

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 13 2002

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 7 05:47 EDT 2024. Contains 372300 sequences. (Running on oeis4.)