id:A082984 - OEIS Search Results

Search: id:A082984

Displaying 1-1 of 1 results found.

page 1

Numbers n for which the 3x+1 problem takes at least n halving and tripling steps to reach 1.

+0
1

3, 5, 6, 7, 9, 11, 14, 15, 18, 19, 27, 31, 41, 47, 54, 55, 62, 63, 71, 73, 82, 83, 91, 94, 95, 97, 108, 109, 110 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`This sequence is almost certainly full; there are no more terms below 100000.`
	EXAMPLE	`3 is in the list because it takes A006577(3) = 7 steps to reach 1 (3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1).`
	CROSSREFS	`Cf. A006577, A006666.` `Sequence in context: A047273 A064802 A047584 this_sequence A039025 A043692 A043775` `Adjacent sequences: A082981 A082982 A082983 this_sequence A082985 A082986 A082987`
	KEYWORD	`nonn`
	AUTHOR	`Hauke Worpel (hw1(AT)email.com), May 29 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.