The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070479 a(n) = n^3 mod 17. 1
 0, 1, 8, 10, 13, 6, 12, 3, 2, 15, 14, 5, 11, 4, 7, 9, 16, 0, 1, 8, 10, 13, 6, 12, 3, 2, 15, 14, 5, 11, 4, 7, 9, 16, 0, 1, 8, 10, 13, 6, 12, 3, 2, 15, 14, 5, 11, 4, 7, 9, 16, 0, 1, 8, 10, 13, 6, 12, 3, 2, 15, 14, 5, 11, 4, 7, 9, 16, 0, 1, 8, 10, 13, 6, 12, 3, 2, 15, 14, 5, 11, 4, 7, 9, 16, 0, 1 (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, Mar 28 2016: (Start) a(n) = a(n-17). G.f.: (-x - 8x^2 - 10x^3 - 13x^4 - 6x^5 - 12x^6 - 3x^7 - 2x^8 - 15x^9 - 14x^10 - 5x^11 - 11x^12 - 4x^13 - 7x^14 - 9x^15 - 16x^16)/(-1 + x^17). (End) MATHEMATICA Table[Mod[n^3, 17], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *) PROG (Sage) [power_mod(n, 3, 17 )for n in range(0, 87)] # Zerinvary Lajos, Oct 29 2009 (MAGMA) [n^3 mod 17: n in [0..80]]; // Vincenzo Librandi, Jun 19 2014 (PARI) a(n)=n^3%17 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Cf. A008960. Sequence in context: A303223 A112549 A112585 * A335172 A184116 A319795 Adjacent sequences:  A070476 A070477 A070478 * A070480 A070481 A070482 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 28 17:31 EDT 2022. Contains 354907 sequences. (Running on oeis4.)