A139399 - OEIS

This site is supported by donations to The OEIS Foundation.

A139399

Number of steps to reach a cycle in Collatz problem.

0, 0, 5, 0, 3, 6, 14, 1, 17, 4, 12, 7, 7, 15, 15, 2, 10, 18, 18, 5, 5, 13, 13, 8, 21, 8, 109, 16, 16, 16, 104, 3, 24, 11, 11, 19, 19, 19, 32, 6, 107, 6, 27, 14, 14, 14, 102, 9, 22, 22, 22, 9, 9, 110, 110, 17, 30, 17, 30, 17, 17, 105, 105, 4, 25, 25, 25, 12, 12, 12, 100, 20, 113, 20 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`a(1)=a(2)=a(4)=0 as A006577(A006577(A006577(x)))=x for x=1,2,4;` `a(n) = A006577(n) - 2 for n > 2 (if the conjecture holds).`
	LINKS	`Index entries for sequences related to 3x+1 (or Collatz) problem` `Eric Weisstein's World of Mathematics, Collatz Problem`
	CROSSREFS	`Essentially the same sequence as A112695.` `Sequence in context: A197573 A019947 A193182 * A021669 A011511 A020856` `Adjacent sequences: A139396 A139397 A139398 * A139400 A139401 A139402`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 18 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.