Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109753
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109753 n^3 mod 8; the periodic sequence {0,1,0,3,0,5,0,7}. +0
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; listen)
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 (ppl(AT)spl.at), 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

CROSSREFS

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

Adjacent sequences: A109750 A109751 A109752 this_sequence A109754 A109755 A109756

Sequence in context: A058026 A004605 A086664 this_sequence A071649 A049283 A051704

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research