id:A102390 - OEIS Search Results

Search: id:A102390

Displaying 1-1 of 1 results found.

page 1

An odious count.

+0
3

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

	OFFSET	`0,3`
	COMMENT	`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: A131104 A141701 A071391 this_sequence A127640 A113303 A080089` `Adjacent sequences: A102387 A102388 A102389 this_sequence A102391 A102392 A102393`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Jan 06 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research