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 iterate where maximal value is reached in the trajectory with that start.

A060411

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 iterate where maximal value is reached in the trajectory with that start.

Terms

    a(0) =0a(1) =2a(2) =3a(3) =4a(4) =45a(5) =8a(6) =31a(7) =14a(8) =48a(9) =28a(10) =49a(11) =33a(12) =26a(13) =50a(14) =35a(15) =43a(16) =67a(17) =39a(18) =69a(19) =39a(20) =35a(21) =124a(22) =83a(23) =37a(24) =132a(25) =46a(26) =81a(27) =75a(28) =83a(29) =118

External references