Consider the 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 iterations reach a sum equal to themselves.
A246544
Consider the 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 iterations reach a sum equal to themselves.
Terms
- a(0) =6a(1) =21a(2) =28a(3) =85a(4) =496a(5) =2133a(6) =8128a(7) =19521a(8) =77125a(9) =97273a(10) =176661a(11) =615281a(12) =4948133a(13) =33550336a(14) =68353213a(15) =129127041a(16) =8589869056
External references
- oeis: A246544