2777775

Appears in sequences

• Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=34A074348
• a(n) = 111111*n.at n=24A154549