A070880 - cp's OEIS frontend

A070880 Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.

n	a(n)
1	0
2	0
3	1
4	3
5	10
6	22
7	52
8	110
9	234
10	482
11	987
12	1997
13	4035
14	8113
15	16288
16	32644
17	65388
18	130886
19	261922
20	524013
21	1048250
22	2096752
23	4193831
24	8388033
25	16776543
26	33553621
27	67107918
28	134216596
29	268434139
30	536869354
31	1073740011
32	2147481510
33	4294964833
34	8589931699

[0, 0, 1, 3, 10, 22, 52, 110, 234, 482, 987, 1997, 4035, 8113, 16288, 32644, 65388, 130886, 261922, 524013, 1048250, 2096752, 4193831, 8388033, 16776543, 33553621, 67107918, 134216596, 268434139, 536869354, 1073740011, 2147481510, 4294964833, 8589931699]

cp's OEIS Frontend

A070880 Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.

Table of values

List of values