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!)
A070700 a(n) = n^7 mod 18. 1

%I #19 Dec 19 2023 13:54:00

%S 0,1,2,9,4,5,0,7,8,9,10,11,0,13,14,9,16,17,0,1,2,9,4,5,0,7,8,9,10,11,

%T 0,13,14,9,16,17,0,1,2,9,4,5,0,7,8,9,10,11,0,13,14,9,16,17,0,1,2,9,4,

%U 5,0,7,8,9,10,11,0,13,14,9,16,17,0,1,2,9,4,5,0,7,8,9,10,11,0,13,14,9,16,17

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

%H Vincenzo Librandi, <a href="/A070700/b070700.txt">Table of n, a(n) for n = 0..1000</a>

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

%t PowerMod[Range[0, 100], 7, 18] (* _Vincenzo Librandi_, Jun 17 2016 *)

%o (Sage) [power_mod(n,7,18) for n in range(90)] # _Zerinvary Lajos_, Oct 28 2009

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

%o (Magma) [Modexp(n, 7, 18): n in [0..80]]; // _Vincenzo Librandi_, Jun 17 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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)