163489

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=25A074348
• G.f. satisfies: A(x) = x + A(x^2 + A(x^3 + A(x^4 + A(x^5 +...)))).at n=20A228835