13051586

Appears in sequences

• Number of multisets of exactly three nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=18A316404
• E.g.f. A(x) satisfies A(x) = 1 + 2 * (exp(x) - 1) * A(exp(x) - 1).at n=7A355083