A randomized version of the Collatz 3x+13x+1 problem

We consider a Markov chain on the positive odd integers, which can be viewed as a stochastic version of the Collatz 3x+13x+1 Problem. We show that, no matter its initial value, the chain visits 1 infinitely often. Its values, however, are unbounded.