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.
A263344
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.
Terms
- a(0) =1700a(1) =5950a(2) =155574a(3) =274550a(4) =300894a(5) =715275a(6) =758625a(7) =1365234a(8) =1404172a(9) =1542500a(10) =1661750a(11) =2095250a(12) =2239750a(13) =2673250a(14) =2962250a(15) =3106750a(16) =3395750a(17) =3829250a(18) =4226625a(19) =4262750a(20) =4407250a(21) =4700619a(22) =5398750a(23) =6371092a(24) =8167635a(25) =8560024a(26) =12305620a(27) =13725855a(28) =15497625a(29) =15586263
External references
- oeis: A263344