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.

A158975 a(n) = sum of numbers k <= n such that all proper divisors of k are divisors of n.

Table of values

n a(n)
1 1
2 3
3 6
4 10
5 11
6 21
7 18
8 30
9 27
10 32
11 29
12 68
13 42
14 60
15 66
16 70
17 59
18 96
19 78
20 120
21 108
22 104
23 101
24 180
25 126
26 131
27 137
28 155
29 130
30 229
31 161
32 221
33 203
34 199
35 221
36 281
37 198
38 240
39 246
40 321
41 239
42 335
43 282
44 360
45 403
46 332
47 329
48 488
49 378
50 418
51 389
52 419
53 382
54 500
55 462
56 557
57 448

List of values

[1, 3, 6, 10, 11, 21, 18, 30, 27, 32, 29, 68, 42, 60, 66, 70, 59, 96, 78, 120, 108, 104, 101, 180, 126, 131, 137, 155, 130, 229, 161, 221, 203, 199, 221, 281, 198, 240, 246, 321, 239, 335, 282, 360, 403, 332, 329, 488, 378, 418, 389, 419, 382, 500, 462, 557, 448]