id:A096303 - OEIS Search Results

Search: id:A096303

Displaying 1-1 of 1 results found.

page 1

Number of iterations of n -> n + (number of 1's in binary representation of n) needed for the trajectory of n to join the trajectory of A010062.

+0
1

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

	OFFSET	`1,6`
	COMMENT	`Conjecture: For any positive integer starting value n, iterations of n -> n + (number of 1's in binary representation of n) will eventually join A010062.`
	EXAMPLE	`a(6)=4 because the trajectory for 1 (sequence A010062) starts` `1->2->3->5->7->10->12->14->17->19->22->25...` `and the trajectory for 6 starts` `6->8->9->11->14->17->19->22->25->28->31->36...` `so the sequence beginning with 6 joins A010062 after 4 steps.`
	CROSSREFS	`Sequence in context: A057075 A130801 A086165 this_sequence A021252 A119708 A106142` `Adjacent sequences: A096300 A096301 A096302 this_sequence A096304 A096305 A096306`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 25 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research