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!)
 A070509 a(n) = n^3 mod 47. 1
 0, 1, 8, 27, 17, 31, 28, 14, 42, 24, 13, 15, 36, 35, 18, 38, 7, 25, 4, 44, 10, 2, 26, 41, 6, 21, 45, 37, 3, 43, 22, 40, 9, 29, 12, 11, 32, 34, 23, 5, 33, 19, 16, 30, 20, 39, 46, 0, 1, 8, 27, 17, 31, 28, 14, 42, 24, 13, 15, 36, 35, 18, 38, 7, 25, 4, 44, 10, 2, 26, 41, 6, 21, 45 (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 a(n) = a(n-47). - G. C. Greubel, Apr 01 2016 MATHEMATICA PowerMod[Range[0, 80], 3, 47] (* Harvey P. Dale, May 30 2015 *) PROG (Sage) [power_mod(n, 3, 47) for n in range(0, 74)] # Zerinvary Lajos, Oct 30 2009 (MAGMA) [Modexp(n, 3, 47): n in [0..80]]; // Bruno Berselli, Mar 31 2016 (PARI) a(n)=n^3%47 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A250140 A070510 A224787 * A070508 A070507 A070506 Adjacent sequences:  A070506 A070507 A070508 * A070510 A070511 A070512 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 15 04:47 EDT 2021. Contains 345043 sequences. (Running on oeis4.)