4700619

Appears in sequences

• a(n) = 3*(n+1)*binomial(n+2,6).at n=16A027779
• Consider the abundant aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some number of iterations reach a sum equal to themselves.at n=21A263344
• a(n) is the least integer that can be expressed as the difference of two heptagonal numbers in exactly n ways.at n=21A334036