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!)
 A070485 a(n) = n^3 mod 23. 1
 0, 1, 8, 4, 18, 10, 9, 21, 6, 16, 11, 20, 3, 12, 7, 17, 2, 14, 13, 5, 19, 15, 22, 0, 1, 8, 4, 18, 10, 9, 21, 6, 16, 11, 20, 3, 12, 7, 17, 2, 14, 13, 5, 19, 15, 22, 0, 1, 8, 4, 18, 10, 9, 21, 6, 16, 11, 20, 3, 12, 7, 17, 2, 14, 13, 5, 19, 15, 22, 0, 1, 8, 4, 18, 10, 9, 21, 6, 16, 11, 20, 3 (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-23). G.f.: (-x -8*x^2 -4*x^3 -18*x^4 -10*x^5 -9*x^6 -21*x^7 -6*x^8 -16*x^9 -11* x^10 -20*x^11 -3*x^12 -12*x^13 -7*x^14 -17*x^15 -2*x^16 -14*x^17 -13*x^18 -5*x^19 -19*x^20 -15*x^21 -22*x^22)/(-1 + x^23). (End) MATHEMATICA Table[Mod[n^3, 23], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *) PowerMod[Range[0, 90], 3, 23] (* G. C. Greubel, Mar 28 2016 *) PROG (Sage) [power_mod(n, 3, 23 )for n in range(0, 82)] #Zerinvary Lajos, Oct 29 2009 (MAGMA) [n^3 mod 23: n in [0..80]]; // Vincenzo Librandi, Jun 19 2014 (PARI) a(n)=n^3%23 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Cf. A008960. Sequence in context: A040059 A178603 A018810 * A248293 A151726 A070290 Adjacent sequences:  A070482 A070483 A070484 * A070486 A070487 A070488 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 September 26 20:36 EDT 2020. Contains 337374 sequences. (Running on oeis4.)