274550

Appears in sequences

• 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=3A263344
• a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero hexagonal numbers in exactly n ways.at n=2A334010