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!)
A070618 a(n) = n^5 mod 35. 1

%I #31 Dec 18 2023 20:26:11

%S 0,1,32,33,9,10,6,7,8,4,5,16,17,13,14,15,11,12,23,24,20,21,22,18,19,

%T 30,31,27,28,29,25,26,2,3,34,0,1,32,33,9,10,6,7,8,4,5,16,17,13,14,15,

%U 11,12,23,24,20,21,22,18,19,30,31,27,28,29,25,26,2,3,34,0,1,32,33,9,10,6

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

%H Vincenzo Librandi, <a href="/A070618/b070618.txt">Table of n, a(n) for n = 0..10000</a>

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

%F a(n+35) = a(n). - _David A. Corneth_, Nov 08 2018

%t PowerMod[Range[0,80],5,35] (* _Harvey P. Dale_, Aug 16 2011 *)

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

%o (Magma) [Modexp(n, 5, 35): n in [0..80]]; // _Vincenzo Librandi_, Aug 17 2011 - Jun 15 2016

%o (PARI) a(n)=n^5%35 \\ _Charles R Greathouse IV_, Apr 06 2016

%o (PARI) a(n) = lift(Mod(n, 35)^5); \\ _Michel Marcus_, Nov 08 2018

%Y Cf. A000584 (n^5).

%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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)