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!)
A070650 a(n) = n^6 mod 27. 0

%I #17 Dec 26 2023 21:16:39

%S 0,1,10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,

%T 1,10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,1,

%U 10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,1,10,0,19,19,0,10,1,0,1,10,0

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

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

%F a(n) = a(n-9). - _Wesley Ivan Hurt_, Dec 26 2023

%t PowerMod[Range[0,100],6,27] (* or *) PadRight[{},100,{0,1,10,0,19,19,0,10,1}] (* _Harvey P. Dale_, Mar 11 2023 *)

%o (Sage) [power_mod(n,6,27)for n in range(0, 85)] # - _Zerinvary Lajos_, Nov 06 2009

%o (PARI) a(n)=n^6%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 April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)