login
This site is supported by donations to The OEIS Foundation.
Logo

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}. 0
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; internal format)
OFFSET

0,4

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 (paoloplava(AT)gmail.com), Nov 21 2006

a(n) = mod[n,(5-3(-1)**n)] = mod[n,A010698(n)] - William A. Tedeschi (fynmun(AT)hotmail.com), Mar 06 2008

PROG

(Other) sage: [power_mod(n, 3, 8 )for n in xrange(0, 105)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 29 2009]

CROSSREFS

Cf. n mod 8 = A010877; n^2 mod 8 = A070432.

Sequence in context: A175919 A086664 A164736 * A167465 A193356 A071649

Adjacent sequences:  A109750 A109751 A109752 * A109754 A109755 A109756

KEYWORD

easy,nonn

AUTHOR

Bruce Corrigan (scentman(AT)myfamily.com), Aug 11 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.