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!)
 A070510 a(n) = n^3 mod 48. 1
 0, 1, 8, 27, 16, 29, 24, 7, 32, 9, 40, 35, 0, 37, 8, 15, 16, 17, 24, 43, 32, 45, 40, 23, 0, 25, 8, 3, 16, 5, 24, 31, 32, 33, 40, 11, 0, 13, 8, 39, 16, 41, 24, 19, 32, 21, 40, 47, 0, 1, 8, 27, 16, 29, 24, 7, 32, 9, 40, 35, 0, 37, 8, 15, 16, 17, 24, 43, 32, 45, 40, 23, 0, 25, 8, 3, 16, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 FORMULA From G. C. Greubel, Apr 01 2016: (Start) a(n) = a(n-48). a(12*m) = 0. a(2*n) = 8*A010875(n). (End) MATHEMATICA PowerMod[Range[0, 80], 3, 48] (* Harvey P. Dale, Apr 03 2013 *) PROG (Sage) [power_mod(n, 3, 48) for n in range(0, 78)] # Zerinvary Lajos, Oct 30 2009 (MAGMA) [Modexp(n, 3, 48): n in [0..80]]; // Bruno Berselli, Mar 31 2016 (PARI) a(n)=n^3%48 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A053149 A102637 A250140 * A224787 A070509 A070508 Adjacent sequences:  A070507 A070508 A070509 * A070511 A070512 A070513 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 June 13 17:09 EDT 2021. Contains 345008 sequences. (Running on oeis4.)