107911

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=24A074348
• a(n) = p^2*(p + 3)/2, where p = prime(n).at n=16A179546
• Number of compositions of n such that the number of parts and the greatest part are not coprime.at n=18A199887
• a(n) = 4*n^3 - 3*n + 1.at n=30A280089