Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.

A074347

Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =12a(4) =13a(5) =52a(6) =53a(7) =131a(8) =271a(9) =811a(10) =1601a(11) =2711a(12) =8111a(13) =13997a(14) =34589a(15) =74551a(16) =147773a(17) =310567a(18) =621227a(19) =1230343a(20) =2627759a(21) =4921373a(22) =10741931a(23) =24965191a(24) =45887291a(25) =111477631a(26) =183638843a(27) =394195667a(28) =788380493a(29) =1576798931

External references