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.

A269347 With a(1) = 1, a(n) is the sum of all 0 < m < n for which a(m) divides n.

Table of values

n a(n)
1 1
2 1
3 3
4 3
5 3
6 15
7 3
8 3
9 30
10 3
11 3
12 51
13 3
14 3
15 84
16 3
17 3
18 111
19 3
20 3
21 150
22 3
23 3
24 195
25 3
26 3
27 246
28 3
29 3
30 318
31 3
32 3
33 366
34 3
35 3
36 435
37 3
38 3
39 510
40 3
41 3
42 591
43 3
44 3
45 684
46 3
47 3
48 771
49 3
50 3
51 882
52 3
53 3
54 975
55 3
56 3
57 1086
58 3
59 3
60 1218
61 3
62 3
63 1326
64 3
65 3
66 1455

List of values

[1, 1, 3, 3, 3, 15, 3, 3, 30, 3, 3, 51, 3, 3, 84, 3, 3, 111, 3, 3, 150, 3, 3, 195, 3, 3, 246, 3, 3, 318, 3, 3, 366, 3, 3, 435, 3, 3, 510, 3, 3, 591, 3, 3, 684, 3, 3, 771, 3, 3, 882, 3, 3, 975, 3, 3, 1086, 3, 3, 1218, 3, 3, 1326, 3, 3, 1455]