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.

A164988 Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 3
8 2
9 3
10 3
11 7
12 2
13 10
14 9
15 7
16 9
17 21
18 8
19 29
20 12
21 31
22 67
23 56
24 11
25 79
26 167
27 105
28 85
29 137
30 37
31 181
32 248
33 346
34 893
35 299
36 106
37 404
38 1974
39 993
40 338
41 669
42 724
43 853
44 3335
45 1068
46 8757
47 1371
48 852
49 2422
50 9157
51 7124
52 17168
53 2702
54 11606
55 6390
56 10782
57 17681
58 68538

List of values

[1, 1, 1, 1, 2, 1, 3, 2, 3, 3, 7, 2, 10, 9, 7, 9, 21, 8, 29, 12, 31, 67, 56, 11, 79, 167, 105, 85, 137, 37, 181, 248, 346, 893, 299, 106, 404, 1974, 993, 338, 669, 724, 853, 3335, 1068, 8757, 1371, 852, 2422, 9157, 7124, 17168, 2702, 11606, 6390, 10782, 17681, 68538]