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!)
A070538 a(n) = n^4 mod 19. 1

%I

%S 0,1,16,5,9,17,4,7,11,6,6,11,7,4,17,9,5,16,1,0,1,16,5,9,17,4,7,11,6,6,

%T 11,7,4,17,9,5,16,1,0,1,16,5,9,17,4,7,11,6,6,11,7,4,17,9,5,16,1,0,1,

%U 16,5,9,17,4,7,11,6,6,11,7,4,17,9,5,16,1,0,1,16,5,9,17,4,7,11,6,6,11,7,4

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

%C Equivalently: n^(18*m + 4) mod 19. - _G. C. Greubel_, Apr 05 2016

%H G. C. Greubel, <a href="/A070538/b070538.txt">Table of n, a(n) for n = 0..1000</a>

%F From _G. C. Greubel_, Apr 05 2016: (Start)

%F a(19*n) = 0.

%F a(n+19) = a(n). (End)

%t PowerMod[Range[0, 100], 4, 19] (* _G. C. Greubel_, Apr 05 2016 *)

%o (Sage) [power_mod(n,4,19)for n in range(0, 90)] # _Zerinvary Lajos_, Oct 31 2009

%o (PARI) a(n)=n^4%19 \\ _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 October 1 04:31 EDT 2022. Contains 357134 sequences. (Running on oeis4.)