A066756 Smallest number that requires n^3 steps to reach 1 in its Collatz trajectory (counting x/2 and 3x+1 steps).

1, 2, 6, 65, 673, 342, 2919, 129991, 1590511, 301695657, 1412987847

Offset

0,2

Comments

a(11) > 7*10^11. - Donovan Johnson

References

R. K. Guy, Problem E16, Unsolved Problems in Number Theory, 2nd edition, Springer-Verlag, NY pp. 215-218

Links

Table of n, a(n) for n=0..10.

Index entries for sequences related to 3x+1 (or Collatz) problem

Formula

Mapping at each step for Collatz problem: x -> x/2 if n is even, else x -> 3*x+1; count the steps until x=1.

Example

a(2) = 6 since the trajectory of 6 requires 2^3 = 8 steps to reach 1 (the trajectory is 6 -> 3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1), and 6 is the smallest number for which this is the case.

Crossrefs

Cf. A006577, A066773.

Sequence in context: A052522 A193609 A061999 * A070872 A055685 A368511

Adjacent sequences: A066753 A066754 A066755 * A066757 A066758 A066759

Keyword

nonn,more

Author

Randall L Rathbun, Jan 18 2002

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Apr 12 2002

a(10) from Donovan Johnson, Nov 13 2010

Edited by Jon E. Schoenfield, Jan 28 2014

Status

approved