id:A132680 - OEIS Search Results

Search: id:A132680

Displaying 1-1 of 1 results found.

page 1

Number of ones in binary representation of odious numbers.

+0
5

1, 1, 1, 3, 1, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 5, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 5, 5, 5, 5, 7, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 5, 5, 5, 5, 7, 3, 3, 3, 5, 3, 5, 5, 5, 3 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) = A000120(A000069(n));` `a(A129771(n)) = a((A129771(n)-1)/2) + 2;` `a(A083420(n)) = A005408(n).`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10001` `Eric Weisstein's World of Mathematics, Odious Number` `Eric Weisstein's World of Mathematics, Thue-Morse Sequence` `Index entries for sequences related to binary expansion of n`
	FORMULA	`a(n) = a(floor(n/2)) + 2(n mod 2)(1-A010060(n)).`
	CROSSREFS	`Sequence in context: A119979 A059787 A081325 this_sequence A105595 A072219 A059789` `Adjacent sequences: A132677 A132678 A132679 this_sequence A132681 A132682 A132683`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 26 2007`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research