Number of multisets of exactly n nonempty binary words with a total of 2n letters such that no word has a majority of 0's.

A292549

Number of multisets of exactly n nonempty binary words with a total of 2n letters such that no word has a majority of 0's.

Terms

    a(0) =1a(1) =3a(2) =10a(3) =33a(4) =98a(5) =291a(6) =826a(7) =2320a(8) =6342a(9) =17188a(10) =45750a(11) =120733a(12) =314690a(13) =813854a(14) =2085363a(15) =5306878a(16) =13406382a(17) =33665476a(18) =84031608a(19) =208655086a(20) =515469203a(21) =1267600993a(22) =3103490884a(23) =7567559622a(24) =18381579206a(25) =44487740012a(26) =107301636460a(27) =257967350824a(28) =618279370985

External references