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.

A325862 Number of integer partitions of n such that every set of distinct parts has a different sum.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 7
6 10
7 14
8 19
9 26
10 34
11 46
12 58
13 77
14 93
15 122
16 146
17 188
18 217
19 282
20 327
21 410
22 470
23 596
24 673
25 848
26 947
27 1178
28 1325
29 1629
30 1798
31 2213
32 2444
33 2962
34 3247
35 3935
36 4292
37 5149
38 5579
39 6674
40 7247
41 8590
42 9221
43 10964
44 11804
45 13870
46 14843
47 17480
48 18675
49 21866

List of values

[1, 1, 2, 3, 5, 7, 10, 14, 19, 26, 34, 46, 58, 77, 93, 122, 146, 188, 217, 282, 327, 410, 470, 596, 673, 848, 947, 1178, 1325, 1629, 1798, 2213, 2444, 2962, 3247, 3935, 4292, 5149, 5579, 6674, 7247, 8590, 9221, 10964, 11804, 13870, 14843, 17480, 18675, 21866]