login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070701 a(n) = n^7 mod 19. 1

%I #19 Dec 19 2023 13:55:10

%S 0,1,14,2,6,16,9,7,8,4,15,11,12,10,3,13,17,5,18,0,1,14,2,6,16,9,7,8,4,

%T 15,11,12,10,3,13,17,5,18,0,1,14,2,6,16,9,7,8,4,15,11,12,10,3,13,17,5,

%U 18,0,1,14,2,6,16,9,7,8,4,15,11,12,10,3,13,17,5,18,0,1,14,2,6,16,9,7,8

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

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

%H <a href="/index/Rec#order_19">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, 0, 1).

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

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

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

%o (Magma) [Modexp(n, 7, 19): 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 | 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 September 19 06:28 EDT 2024. Contains 376004 sequences. (Running on oeis4.)