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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Equivalently, n^7 mod 24.  - Zerinvary Lajos, Oct 29 2009 Equivalent: n^(2m+3) mod 24, m>=1, m being an integer. - G. C. Greubel, Mar 30 2016 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, 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). FORMULA a(n) = a(n-24). - G. C. Greubel, Mar 30 2016 MATHEMATICA 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 *) PROG (Sage) [power_mod(n, 3, 24) for n in range(0, 86)] # Zerinvary Lajos, Oct 29 2009 CROSSREFS Sequence in context: A265236 A286568 A070608 * A195161 A144433 A274401 Adjacent sequences:  A070483 A070484 A070485 * A070487 A070488 A070489 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 12 2002 STATUS approved

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 August 14 04:13 EDT 2020. Contains 336477 sequences. (Running on oeis4.)