A088568 - OEIS

This site is supported by donations to The OEIS Foundation.

A088568

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

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; refs; listen; history; internal format)

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

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

Last modified February 16 06:18 EST 2012. Contains 205860 sequences.