263177

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=26A074348
• Product of exactly three distinct primes congruent to 1 mod 8 (A007519).at n=23A185379