63728127
domain: N
Appears in sequences
- In the '3x+1' problem, these values for the starting value set new records for the "dropping time", number of steps to reach a lower value than the start.at n=18A060412
- Record n for the sequence A006666(n)/log(n), for n > 1; i.e., the n at which the number of steps to 1 for the halving-Collatz iteration divided by log(n) sets a new maximum.at n=12A123481
- Numbers achieving strength records in 3x+1 problem.at n=1A217937
- Numbers n such that the ratio of tripling steps to halving steps in the Collatz (3x+1) trajectory of n is greater than all previous ratios.at n=13A248037
- Numbers that have the largest Collatz total stopping time of all numbers below 10^n. The smallest number is chosen in case of ties.at n=7A284668
- Inputs n that yield a record-breaking value of A008908(n)/(log_2(n)+1) for the Collatz conjecture.at n=19A339614