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.

A255242 Calculate the aliquot parts of a number n and take their sum. Then repeat the process calculating the aliquot parts of all the previous aliquot parts and add their sum to the previous one. Repeat the process until the sum to be added is zero. Sequence lists these sums.

Table of values

n a(n)
1 0
2 1
3 1
4 4
5 1
6 8
7 1
8 12
9 5
10 10
11 1
12 30
13 1
14 12
15 11
16 32
17 1
18 36
19 1
20 38
21 13
22 16
23 1
24 92
25 7
26 18
27 19
28 46
29 1
30 74
31 1
32 80
33 17
34 22
35 15
36 140
37 1
38 24
39 19
40 116
41 1
42 90
43 1
44 62
45 51
46 28
47 1
48 256
49 9
50 62
51 23
52 70
53 1
54 136
55 19
56 140
57 25
58 34
59 1
60 286
61 1
62 36
63 61
64 192
65 21
66 122
67 1
68 86
69 29
70 114

List of values

[0, 1, 1, 4, 1, 8, 1, 12, 5, 10, 1, 30, 1, 12, 11, 32, 1, 36, 1, 38, 13, 16, 1, 92, 7, 18, 19, 46, 1, 74, 1, 80, 17, 22, 15, 140, 1, 24, 19, 116, 1, 90, 1, 62, 51, 28, 1, 256, 9, 62, 23, 70, 1, 136, 19, 140, 25, 34, 1, 286, 1, 36, 61, 192, 21, 122, 1, 86, 29, 114]