104371

Appears in sequences

• Fermat coefficients.at n=28A000970
• a(n) = floor(C(n,4)/5).at n=61A011795
• 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=23A074348
• a(n) = binomial(5n+6, 4)/5 for n >= 0.at n=11A238471