cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A307859 Consider the non-unitary 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.

Table of values

n a(n)
1 24
2 112
3 189
4 578
5 1984
6 2125
7 3993
8 5043
9 9583
10 19197
11 32512
12 126445
13 149565
14 175689
15 225578
16 236883
17 1589949
18 1862935
19 1928125
20 3171174
21 5860526
22 6149405
23 11442047
24 16731741
25 60634549
26 75062535
27 134201344
28 177816209
29 1162143369
30 4474779517
31 10369035821

List of values

[24, 112, 189, 578, 1984, 2125, 3993, 5043, 9583, 19197, 32512, 126445, 149565, 175689, 225578, 236883, 1589949, 1862935, 1928125, 3171174, 5860526, 6149405, 11442047, 16731741, 60634549, 75062535, 134201344, 177816209, 1162143369, 4474779517, 10369035821]