Smallest number that requires n^3 steps to reach 1 in its Collatz trajectory (counting x/2 and 3x+1 steps).
A066756
Smallest number that requires n^3 steps to reach 1 in its Collatz trajectory (counting x/2 and 3x+1 steps).
Terms
- a(0) =1a(1) =2a(2) =6a(3) =65a(4) =673a(5) =342a(6) =2919a(7) =129991a(8) =1590511a(9) =301695657a(10) =1412987847
External references
- oeis: A066756