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.

A370595 Number of integer partitions of n such that only one set can be obtained by choosing a different divisor of each part.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 2
5 0
6 3
7 2
8 4
9 3
10 4
11 5
12 8
13 9
14 8
15 13
16 12
17 17
18 16
19 27
20 28
21 33
22 36
23 39
24 50
25 58
26 65
27 75
28 93
29 94
30 112
31 125
32 148
33 170
34 190
35 209
36 250
37 273
38 305
39 341
40 403
41 432
42 484
43 561
44 623
45 708
46 765
47 873
48 977
49 1109
50 1178
51 1367
52 1493
53 1669
54 1824
55 2054
56 2265
57 2521
58 2770

List of values

[1, 1, 0, 1, 2, 0, 3, 2, 4, 3, 4, 5, 8, 9, 8, 13, 12, 17, 16, 27, 28, 33, 36, 39, 50, 58, 65, 75, 93, 94, 112, 125, 148, 170, 190, 209, 250, 273, 305, 341, 403, 432, 484, 561, 623, 708, 765, 873, 977, 1109, 1178, 1367, 1493, 1669, 1824, 2054, 2265, 2521, 2770]