8388033

Appears in sequences

• 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.at n=23A070880
• a(n) = 2^n - n*(n+2).at n=23A176778