Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.

A089605

Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =1a(5) =0a(6) =0a(7) =0a(8) =2a(9) =0a(10) =0a(11) =0a(12) =1a(13) =2a(14) =0a(15) =1a(16) =3a(17) =3a(18) =0a(19) =1a(20) =1a(21) =1a(22) =0a(23) =1a(24) =2a(25) =1a(26) =3a(27) =1a(28) =1a(29) =1

External references