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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101565 a(n)=sum{k=0..n, (-1)^A010060(n-k)*if(mod(n+1,k+1)=0,1,0)}. 0
1, 0, 0, 1, 0, 2, 2, 0, 1, 2, 2, 2, 2, 0, 2, 1, 0, 4, 2, 2, 2, 0, 0, 2, 3, 0, 2, 0, 0, 4, 2, 0, 0, 2, 2, 5, 2, 0, 0, 2, 2, 0, 0, 2, 2, 2, 2, 2, 1, 2, 2, 2, 0, 6, 0, -2, 0, 2, 2, 4, 2, 0, 0, 1, 0, 2, 2, 2, 4, 2, 0, 6, 2, 0, 0, 2, 0, 4, 2, 2, 5, 0, 0, 2, 2, 2, 2, 2, 0, 4, 2, 0, 2, 0, 0, 2, 2, -2, 2, 5, 0 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

CROSSREFS

Sequence in context: A058643 A029368 A108483 * A029341 A079070 A096994

Adjacent sequences:  A101562 A101563 A101564 * A101566 A101567 A101568

KEYWORD

easy,sign

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 07 2004

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 16 12:41 EST 2012. Contains 205909 sequences.