A102390 - OEIS

This site is supported by donations to The OEIS Foundation.

A102390

An odious count.

0, 1, 2, 0, 3, 0, 0, 4, 5, 0, 0, 6, 0, 7, 8, 0, 9, 0, 0, 10, 0, 11, 12, 0, 0, 13, 14, 0, 15, 0, 0, 16, 17, 0, 0, 18, 0, 19, 20, 0, 0, 21, 22, 0, 23, 0, 0, 24, 0, 25, 26, 0, 27, 0, 0, 28, 29, 0, 0, 30, 0, 31, 32, 0, 33, 0, 0, 34, 0, 35, 36, 0, 0, 37, 38, 0, 39, 0, 0, 40, 0, 41, 42, 0, 43, 0, 0, 44 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`Counting numbers appear at positions indexed by the odious numbers A000069, 0 otherwise. A008619(n)=A102389(n)+A102390(n).`
	FORMULA	`a(n)=(1+floor(n/2))(1-(-1)^A000120(n))/2; a(n)=(1+floor(n/2))(1-(-1)^A010060(n))/2.`
	CROSSREFS	`Sequence in context: A141701 A167990 A071391 * A127640 A113303 A080089` `Adjacent sequences: A102387 A102388 A102389 * A102391 A102392 A102393`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Jan 06 2005`

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

Last modified February 15 11:56 EST 2012. Contains 205781 sequences.