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

%I #15 Dec 26 2023 21:04:37

%S 0,1,2,16,4,1,1,4,8,8,2,4,2,16,8,16,16,8,16,2,4,2,8,8,4,1,1,4,16,2,1,

%T 0,1,2,16,4,1,1,4,8,8,2,4,2,16,8,16,16,8,16,2,4,2,8,8,4,1,1,4,16,2,1,

%U 0,1,2,16,4,1,1,4,8,8,2,4,2,16,8,16,16,8,16,2,4,2,8,8,4,1,1,4,16,2,1,0,1,2

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

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

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

%t PowerMod[Range[0,100],6,31] (* _Harvey P. Dale_, May 19 2021 *)

%o (Sage) [power_mod(n,6,31)for n in range(0, 96)] # _Zerinvary Lajos_, Nov 07 2009

%o (PARI) a(n)=n^6%31 \\ _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 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)