A263344 - cp's OEIS frontend

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.

n	a(n)
1	1700
2	5950
3	155574
4	274550
5	300894
6	715275
7	758625
8	1365234
9	1404172
10	1542500
11	1661750
12	2095250
13	2239750
14	2673250
15	2962250
16	3106750
17	3395750
18	3829250
19	4226625
20	4262750
21	4407250
22	4700619
23	5398750
24	6371092
25	8167635
26	8560024
27	12305620
28	13725855
29	15497625
30	15586263

[1700, 5950, 155574, 274550, 300894, 715275, 758625, 1365234, 1404172, 1542500, 1661750, 2095250, 2239750, 2673250, 2962250, 3106750, 3395750, 3829250, 4226625, 4262750, 4407250, 4700619, 5398750, 6371092, 8167635, 8560024, 12305620, 13725855, 15497625, 15586263]

cp's OEIS Frontend

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.

Table of values

List of values