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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070480 a(n) = n^3 mod 18. 1
 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17, 0, 1, 8, 9, 10, 17 (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-6). G.f.: (-x -8*x^2 -9*x^3 -10*x^4 -17*x^5)/(-1 + x^6). (End) MATHEMATICA Table[Mod[n^3, 18], {n, 0, 100}] (* G. C. Greubel, Mar 28 2016 *) PROG (Sage) [power_mod(n, 3, 18 )for n in range(0, 90)] # Zerinvary Lajos, Oct 29 2009 (Magma) [Modexp(n, 3, 18): n in [0..100]]; // Vincenzo Librandi, Mar 28 2016 (PARI) x='x+O('x^99); concat(0, Vec((-x-8*x^2-9*x^3-10*x^4-17*x^5) / (-1+x^6))) \\ Altug Alkan, Mar 28 2016 CROSSREFS Sequence in context: A091417 A069237 A334728 * A135043 A054966 A130881 Adjacent sequences: A070477 A070478 A070479 * A070481 A070482 A070483 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 December 1 14:09 EST 2023. Contains 367476 sequences. (Running on oeis4.)