Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.
A076424
Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =12a(4) =31a(5) =23a(6) =56a(7) =102a(8) =193a(9) =257a(10) =570a(11) =1129a(12) =4970a(13) =3229a(14) =11551a(15) =11969a(16) =24232a(17) =20094a(18) =24103a(19) =35996a(20) =100090a(21) =222284a(22) =116269a(23) =231488a(24) =388768a(25) =1751753a(26) =2046872a(27) =1140163a(28) =1149979a(29) =2156214
External references
- oeis: A076424