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!)
 A109753 n^3 mod 8; the periodic sequence {0,1,0,3,0,5,0,7}. 1
 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 0, 3, 0, 5, 0, 7, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 1). FORMULA G.f. = (x+3x^3+5x^5+7x^7)/(1-x^8) a(n)=1/56*{53*(n mod 8)-45*[(n+1) mod 8]+39*[(n+2) mod 8]-31*[(n+3) mod 8]+25*[(n+4) mod 8]-17*[(n+5) mod 8]+11*[(n+6) mod 8]-3*[(n+7) mod 8]} - Paolo P. Lava, Nov 21 2006 a(n) = mod[n,(5-3(-1)**n)] = mod[n,A010698(n)] - William A. Tedeschi, Mar 06 2008 PROG (Sage) [power_mod(n, 3, 8 )for n in xrange(0, 105)] # - Zerinvary Lajos, Oct 29 2009 (PARI) a(n)=n^3%8 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Cf. n mod 8 = A010877; n^2 mod 8 = A070432. Sequence in context: A175919 A086664 A164736 * A318517 A245494 A167465 Adjacent sequences:  A109750 A109751 A109752 * A109754 A109755 A109756 KEYWORD easy,nonn AUTHOR Bruce Corrigan (scentman(AT)myfamily.com), Aug 11 2005 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 18 20:57 EST 2019. Contains 319282 sequences. (Running on oeis4.)