This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167176 n^3 mod 9. 5
 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Essentially a duplicate of A021559. - N. J. A. Sloane, Oct 30 2009 Equivalently: n^(6*m + 3) mod 9. - G. C. Greubel, Jun 04 2016 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,1). FORMULA G.f.: -x*(1+8*x) / ( (x-1)*(1+x+x^2) ). - R. J. Mathar, Aug 24 2016 MATHEMATICA Table[Mod[n^3, 9], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2011 *) PROG (Sage) [power_mod(n, 3, 9 ) for n in xrange(0, 105)] (PARI) a(n)=n^3%9 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A272343 A011314 A021559 * A195447 A160389 A011104 Adjacent sequences:  A167173 A167174 A167175 * A167177 A167178 A167179 KEYWORD nonn,easy AUTHOR Zerinvary Lajos, Oct 29 2009 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 January 20 16:46 EST 2019. Contains 319335 sequences. (Running on oeis4.)