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.

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

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 1
5 3
6 2
7 4
8 5
9 7
10 10
11 11
12 15
13 18
14 25
15 28
16 39
17 45
18 59
19 66
20 83
21 101
22 123
23 150
24 176
25 213
26 252
27 301
28 352
29 426
30 497
31 589
32 684
33 802
34 939
35 1095
36 1270
37 1480
38 1718
39 1985
40 2289
41 2645
42 3056
43 3489
44 4019
45 4590
46 5289
47 6014
48 6877
49 7817
50 8955
51 10134
52 11551
53 13085

List of values

[0, 0, 1, 1, 1, 3, 2, 4, 5, 7, 10, 11, 15, 18, 25, 28, 39, 45, 59, 66, 83, 101, 123, 150, 176, 213, 252, 301, 352, 426, 497, 589, 684, 802, 939, 1095, 1270, 1480, 1718, 1985, 2289, 2645, 3056, 3489, 4019, 4590, 5289, 6014, 6877, 7817, 8955, 10134, 11551, 13085]