id:A101565 - OEIS Search Results

Search: id:A101565

Displaying 1-1 of 1 results found.

page 1

a(n)=sum{k=0..n, (-1)^A010060(n-k)*if(mod(n+1,k+1)=0,1,0)}.

+0
1

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; listen)

	OFFSET	`0,6`
	CROSSREFS	`Adjacent sequences: A101562 A101563 A101564 this_sequence A101566 A101567 A101568` `Sequence in context: A058643 A029368 A108483 this_sequence A029341 A079070 A096994`
	KEYWORD	`easy,sign`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 07 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research