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.

A296966 Sum of all the parts in the partitions of n into two distinct parts such that the smaller part divides the larger.

Table of values

n a(n)
1 0
2 0
3 3
4 4
5 5
6 12
7 7
8 16
9 18
10 20
11 11
12 48
13 13
14 28
15 45
16 48
17 17
18 72
19 19
20 80
21 63
22 44
23 23
24 144
25 50
26 52
27 81
28 112
29 29
30 180
31 31
32 128
33 99
34 68
35 105
36 252
37 37
38 76
39 117
40 240
41 41
42 252
43 43
44 176
45 225
46 92
47 47
48 384
49 98
50 200
51 153
52 208
53 53
54 324
55 165
56 336
57 171
58 116
59 59
60 600
61 61

List of values

[0, 0, 3, 4, 5, 12, 7, 16, 18, 20, 11, 48, 13, 28, 45, 48, 17, 72, 19, 80, 63, 44, 23, 144, 50, 52, 81, 112, 29, 180, 31, 128, 99, 68, 105, 252, 37, 76, 117, 240, 41, 252, 43, 176, 225, 92, 47, 384, 98, 200, 153, 208, 53, 324, 165, 336, 171, 116, 59, 600, 61]