A325867 - cp's OEIS frontend

A325867 Number of maximal subsets of {1..n} containing n such that every subset has a different sum.

n	a(n)
1	1
2	1
3	2
4	2
5	4
6	8
7	10
8	12
9	17
10	34
11	45
12	77
13	99
14	136
15	166
16	200
17	238
18	328
19	402
20	660
21	674
22	1166
23	1331
24	1966
25	2335
26	3286
27	3527
28	4762
29	5383
30	6900
31	7543
32	9087
33	10149
34	12239
35	13569
36	16452
37	17867
38	22869
39	23977
40	33881
41	33820
42	43423
43	48090
44	68683
45	67347
46	95176
47	97917
48	131666
49	136205

[1, 1, 2, 2, 4, 8, 10, 12, 17, 34, 45, 77, 99, 136, 166, 200, 238, 328, 402, 660, 674, 1166, 1331, 1966, 2335, 3286, 3527, 4762, 5383, 6900, 7543, 9087, 10149, 12239, 13569, 16452, 17867, 22869, 23977, 33881, 33820, 43423, 48090, 68683, 67347, 95176, 97917, 131666, 136205]

cp's OEIS Frontend

A325867 Number of maximal subsets of {1..n} containing n such that every subset has a different sum.

Table of values

List of values