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.

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.

Terms

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

External references