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!)
A070623 a(n) = n^5 mod 40. 0

%I #15 Dec 26 2023 22:09:42

%S 0,1,32,3,24,5,16,7,8,9,0,11,32,13,24,15,16,17,8,19,0,21,32,23,24,25,

%T 16,27,8,29,0,31,32,33,24,35,16,37,8,39,0,1,32,3,24,5,16,7,8,9,0,11,

%U 32,13,24,15,16,17,8,19,0,21,32,23,24,25,16,27,8,29,0,31,32,33,24,35,16

%N a(n) = n^5 mod 40.

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

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

%t PowerMod[Range[0,80],5,40] (* _Harvey P. Dale_, Aug 25 2014 *)

%o (Sage) [power_mod(n,5,40)for n in range(0, 77)] # _Zerinvary Lajos_, Nov 04 2009

%o (PARI) a(n)=n^5%40 \\ _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 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)