A325877 - cp's OEIS frontend

A325877 Number of strict integer partitions of n such that every orderless pair of distinct parts has a different sum.

n	a(n)
0	1
1	1
2	1
3	2
4	2
5	3
6	4
7	5
8	6
9	8
10	9
11	12
12	14
13	18
14	19
15	26
16	28
17	36
18	37
19	50
20	52
21	67
22	68
23	89
24	94
25	115
26	121
27	151
28	160
29	195
30	200
31	247
32	265
33	312
34	329
35	386
36	418
37	487
38	519
39	600
40	640
41	742
42	792
43	901
44	978
45	1088
46	1185
47	1331
48	1453
49	1605
50	1729
51	1925
52	2101
53	2311
54	2524
55	2741
56	3000

[1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 12, 14, 18, 19, 26, 28, 36, 37, 50, 52, 67, 68, 89, 94, 115, 121, 151, 160, 195, 200, 247, 265, 312, 329, 386, 418, 487, 519, 600, 640, 742, 792, 901, 978, 1088, 1185, 1331, 1453, 1605, 1729, 1925, 2101, 2311, 2524, 2741, 3000]

cp's OEIS Frontend

A325877 Number of strict integer partitions of n such that every orderless pair of distinct parts has a different sum.

Table of values

List of values