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

A316403

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

Terms

    a(0) =1a(1) =3a(2) =10a(3) =23a(4) =59a(5) =134a(6) =320a(7) =699a(8) =1599a(9) =3434a(10) =7682a(11) =16246a(12) =35762a(13) =74892a(14) =163032a(15) =338771a(16) =731051a(17) =1510466a(18) =3237206a(19) =6658530a(20) =14189790a(21) =29083988a(22) =61687496a(23) =126076638a(24) =266332390a(25) =543061284a(26) =1143207236a(27) =2326521164a(28) =4882706596a(29) =9920514328

External references