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.

A379756 a(n) is the number of subsets of S(n) that sum to A023196(n), where S(n) is the set of the proper divisors (or aliquot parts) of A023196(n).

Table of values

n a(n)
1 1
2 2
3 2
4 1
5 5
6 1
7 3
8 7
9 3
10 2
11 10
12 3
13 2
14 34
15 2
16 0
17 31
18 1
19 6
20 25
21 1
22 23
23 21
24 2
25 1
26 1
27 20
28 4
29 1
30 279
31 13
32 15
33 1
34 15
35 116
36 9
37 11
38 12
39 4
40 197
41 1
42 2
43 755
44 1
45 42
46 2
47 9
48 12
49 6
50 2
51 151
52 169
53 7
54 1
55 9
56 8
57 6
58 2190
59 1
60 516
61 1
62 6
63 121
64 130
65 1
66 6
67 119
68 1
69 469
70 4
71 446
72 1
73 4
74 6

List of values

[1, 2, 2, 1, 5, 1, 3, 7, 3, 2, 10, 3, 2, 34, 2, 0, 31, 1, 6, 25, 1, 23, 21, 2, 1, 1, 20, 4, 1, 279, 13, 15, 1, 15, 116, 9, 11, 12, 4, 197, 1, 2, 755, 1, 42, 2, 9, 12, 6, 2, 151, 169, 7, 1, 9, 8, 6, 2190, 1, 516, 1, 6, 121, 130, 1, 6, 119, 1, 469, 4, 446, 1, 4, 6]