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!)
A070597 Duplicate of A070474. 1

%I #19 Feb 02 2021 20:29:22

%S 0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,

%T 9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,

%U 0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3

%N Duplicate of A070474.

%C a(n)=A070474(n) [Proof: n^5-n^3 == 0 (mod 12) is shown explicitly for n=0 to 11, then the induction n->n+12 for the 5th-order polynomial followed by binomial expansion of (n+12)^k concludes that the zero (mod 12) is periodically extended to the other integers.] - _R. J. Mathar_, Jul 23 2009

%t Table[Mod[n^5,12],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 23 2011 *)

%o (Sage) [power_mod(n,7,12) for n in range(0, 100)] # _Zerinvary Lajos_, Oct 28 2009

%Y Cf. A008960, A070474.

%K dead

%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 September 13 17:14 EDT 2024. Contains 375910 sequences. (Running on oeis4.)