id:A008687 - OEIS Search Results

Search: id:A008687

Displaying 1-1 of 1 results found.

page 1

Number of 1's in 2's complement representation of -n.

+0
7

0, 1, 1, 2, 1, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4, 3, 4, 3, 3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 7, 6, 6, 5, 6, 5, 5, 4, 6, 5, 5, 4, 5, 4, 4, 3, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4, 3, 4, 3, 3 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`a(A127904(n)) = n and a(m) < n for m < A127904(n). - Reinhard Zumkeller, Feb 05 2007`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000` `Michael Gilleland, Some Self-Similar Integer Sequences`
	FORMULA	`a(n) = if n<=1 then n else (n mod 2) + a((n mod 2) + floor(n/2)). - Reinhard Zumkeller, Feb 05 2007` `a(n) = if n<2 then n else a(ceiling(n/2)) + n mod 2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 25 2006` `Min{m: a(m)=n} = if n>0 then A083318(n-1) else 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 25 2006`
	CROSSREFS	`A023416(n-1) + 1.` `This is Guy Steele's sequence GS(4, 3) (see A135416).` `Sequence in context: A157810 A072339 A038571 this_sequence A080801 A124758 A071481` `Adjacent sequences: A008684 A008685 A008686 this_sequence A008688 A008689 A008690`
	KEYWORD	`nonn,base`
	AUTHOR	`R. H. Hardin (rhhardin(AT)att.net) (R. H. Hardin)`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research