The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A070570 a(n) = n^4 mod 27. 0

%I #15 Dec 18 2023 17:27:29

%S 0,1,16,0,13,4,0,25,19,0,10,7,0,22,22,0,7,10,0,19,25,0,4,13,0,16,1,0,

%T 1,16,0,13,4,0,25,19,0,10,7,0,22,22,0,7,10,0,19,25,0,4,13,0,16,1,0,1,

%U 16,0,13,4,0,25,19,0,10,7,0,22,22,0,7,10,0,19,25,0,4,13,0,16,1,0,1,16,0

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

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

%t PowerMod[Range[0,90],4,27] (* _Harvey P. Dale_, Apr 23 2015 *)

%o (Sage) [power_mod(n,4,27)for n in range(0, 84)] # - _Zerinvary Lajos_, Nov 01 2009

%o (PARI) a(n)=n^4%27 \\ _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 June 4 05:32 EDT 2024. Contains 373089 sequences. (Running on oeis4.)