For odd numbers 2n-1, the minimum number of iterations of the reduced Collatz function R required to yield 1. The function R is defined as R(k) = (3k+1)/2^r, with r as large as possible.
A075680
For odd numbers 2n-1, the minimum number of iterations of the reduced Collatz function R required to yield 1. The function R is defined as R(k) = (3k+1)/2^r, with r as large as possible.
Terms
- a(0) =0a(1) =2a(2) =1a(3) =5a(4) =6a(5) =4a(6) =2a(7) =5a(8) =3a(9) =6a(10) =1a(11) =4a(12) =7a(13) =41a(14) =5a(15) =39a(16) =8a(17) =3a(18) =6a(19) =11a(20) =40a(21) =9a(22) =4a(23) =38a(24) =7a(25) =7a(26) =2a(27) =41a(28) =10a(29) =10
External references
- oeis: A075680