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.

A325857 Number of integer partitions of n such that every orderless pair 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 11
7 15
8 22
9 30
10 41
11 55
12 74
13 97
14 125
15 165
16 209
17 269
18 335
19 428
20 527
21 664
22 804
23 1005
24 1210
25 1496
26 1780
27 2186
28 2586
29 3148
30 3698
31 4473
32 5226
33 6279
34 7290
35 8706
36 10067
37 11950
38 13744
39 16242
40 18605
41 21864
42 24942
43 29184
44 33188
45 38651
46 43782
47 50791
48 57402
49 66300
50 74683
51 86026
52 96658

List of values

[1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 41, 55, 74, 97, 125, 165, 209, 269, 335, 428, 527, 664, 804, 1005, 1210, 1496, 1780, 2186, 2586, 3148, 3698, 4473, 5226, 6279, 7290, 8706, 10067, 11950, 13744, 16242, 18605, 21864, 24942, 29184, 33188, 38651, 43782, 50791, 57402, 66300, 74683, 86026, 96658]