id:A080791 - OEIS Search Results

Search: id:A080791

Displaying 1-1 of 1 results found.

page 1

Number of 0's in binary expansion of n.

+0
15

0, 0, 1, 0, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 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, 5, 4, 4, 3, 4, 3, 3, 2, 4 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`Another version (A023416) has a(0) = 1.` `Number of steps required to reach 1, starting at n+1, under the operation: if x is even divide by 2 else add 1. This is the x+1 problem (as opposed to the 3x+1 problem).`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n = 0..10000` `Index entries for sequences related to binary expansion of n`
	PROGRAM	`(PARI) a(n)=if(n<1, 0, a(n\2)+1-n%2)`
	CROSSREFS	`Cf. A023416, A080791-A080801.` `Adjacent sequences: A080788 A080789 A080790 this_sequence A080792 A080793 A080794` `Sequence in context: A116382 A050606 A023416 this_sequence A124748 A119513 A085815`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Mar 25 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research