In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated "dropping time", number of steps to reach a lower value than the start.

A060409

In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated "dropping time", number of steps to reach a lower value than the start.

Terms

    a(0) =1a(1) =4a(2) =7a(3) =7a(4) =59a(5) =13a(6) =40a(7) =23a(8) =81a(9) =61a(10) =70a(11) =65a(12) =54a(13) =72a(14) =65a(15) =59a(16) =127a(17) =105a(18) =110a(19) =59a(20) =72a(21) =164a(22) =140a(23) =73a(24) =170a(25) =105a(26) =149a(27) =97a(28) =135a(29) =183

External references