A004074 - OEIS

This site is supported by donations to The OEIS Foundation.

A004074

2*A004001(n) - n.

1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 3, 2, 3, 2, 1, 0, 1, 2, 3, 4, 3, 4, 5, 4, 5, 4, 3, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 7, 8, 7, 6, 7, 6, 5, 4, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 5, 6, 7, 8, 9, 8, 9, 10, 11, 10, 11, 12, 11, 12, 11, 10, 11, 12, 13, 12, 13, 14, 13, 14, 13, 12 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,6`
	REFERENCES	`T. Kubo et al., On Conway's recursive sequence, Discrete Math. 152 1996 225-252.`
	FORMULA	`a(2^n)=0; for n>=1 sum(i=2^(n-1), 2^n, a(i)) = A082590(n-2) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 04 2004`
	CROSSREFS	`Cf. A004001.` `Sequence in context: A002819 A037834 A179765 * A053646 A080776 A065358` `Adjacent sequences: A004071 A004072 A004073 * A004075 A004076 A004077`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Benoit Cloitre, Jun 04 2004`

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

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.