Number of iterations of the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))) to reach zero, or -1 if zero is never reached. lpd(k) is the largest proper divisor and gpf(k) is the greatest prime factor of k.

A076423

Number of iterations of the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))) to reach zero, or -1 if zero is never reached. lpd(k) is the largest proper divisor and gpf(k) is the greatest prime factor of k.

Terms

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

External references