A364613 - cp's OEIS frontend

A364613 a(n) = number of partitions of n whose sum multiset is free of duplicates; see Comments.

n	a(n)
0	1
1	1
2	2
3	2
4	3
5	3
6	5
7	5
8	7
9	8
10	10
11	12
12	15
13	18
14	20
15	26
16	29
17	36
18	38
19	50
20	53
21	67
22	69
23	89
24	95
25	115
26	122
27	151
28	161
29	195
30	201
31	247
32	266
33	312
34	330
35	386
36	419
37	487
38	520
39	600
40	641
41	742
42	793
43	901
44	979
45	1088
46	1186
47	1331
48	1454
49	1605
50	1730
51	1925
52	2102
53	2311
54	2525
55	2741
56	3001

[1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 12, 15, 18, 20, 26, 29, 36, 38, 50, 53, 67, 69, 89, 95, 115, 122, 151, 161, 195, 201, 247, 266, 312, 330, 386, 419, 487, 520, 600, 641, 742, 793, 901, 979, 1088, 1186, 1331, 1454, 1605, 1730, 1925, 2102, 2311, 2525, 2741, 3001]

cp's OEIS Frontend

A364613 a(n) = number of partitions of n whose sum multiset is free of duplicates; see Comments.

Table of values

List of values