The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070486 a(n) = n^3 mod 24 (or equivalently, n^5 mod 24). 2

%I

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

%T 16,5,0,7,8,9,16,11,0,13,8,15,16,17,0,19,8,21,16,23,0,1,8,3,16,5,0,7,

%U 8,9,16,11,0,13,8,15,16,17,0,19,8,21,16,23,0,1,8,3,16,5,0,7,8,9,16,11,0,13

%N a(n) = n^3 mod 24 (or equivalently, n^5 mod 24).

%C Equivalently, n^7 mod 24. - _Zerinvary Lajos_, Oct 29 2009

%C Equivalent: n^(2m+3) mod 24, m>=1, m being an integer. - _G. C. Greubel_, Mar 30 2016

%H G. C. Greubel, <a href="/A070486/b070486.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = a(n-24). - _G. C. Greubel_, Mar 30 2016

%t PowerMod[Range[0,100],3,24] (* or *) PadRight[{},100,{0,1,8,3,16,5,0,7,8,9,16,11,0,13,8,15,16,17,0,19,8,21,16,23}] (* _Harvey P. Dale_, Jul 26 2015 *)

%o (Sage) [power_mod(n,3,24) for n in range(0, 86)] # _Zerinvary Lajos_, Oct 29 2009

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 00:14 EDT 2020. Contains 337378 sequences. (Running on oeis4.)