id:A088568 - OEIS Search Results

Search: id:A088568

Displaying 1-1 of 1 results found.

page 1

a(n)=3n-2*sum(k=1,n,A000002(k)).

+0
1

1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, -1, -2, -1, -2, -3, -2, -1, -2, -1, 0, -1, -2, -1, -2, -1, 0, -1, 0, -1 (list; graph; listen)

	OFFSET	`1,12`
	FORMULA	`It is conjectured that a(n)=o(n)`
	CROSSREFS	`Sequence in context: A135929 A080733 A080732 this_sequence A123737 A083037 A072927` `Adjacent sequences: A088565 A088566 A088567 this_sequence A088569 A088570 A088571`
	KEYWORD	`sign`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 17 2003; definition changed Oct 16 2005`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research