In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

A060415

In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

Terms

    a(0) =0a(1) =2a(2) =3a(3) =45a(4) =48a(5) =20a(6) =78a(7) =124a(8) =95a(9) =103a(10) =62a(11) =147a(12) =186a(13) =36a(14) =168a(15) =65a(16) =60a(17) =179a(18) =41a(19) =146a(20) =254a(21) =254a(22) =319a(23) =346a(24) =423a(25) =166a(26) =297a(27) =206a(28) =223a(29) =164

External references