Number of sets of nonempty words with a total of n letters over binary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A293741
Number of sets of nonempty words with a total of n letters over binary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =10a(5) =23a(6) =51a(7) =111a(8) =243a(9) =530a(10) =1156a(11) =2497a(12) =5421a(13) =11662a(14) =25179a(15) =53991a(16) =116035a(17) =248025a(18) =531045a(19) =1131943a(20) =2415495a(21) =5135914a(22) =10927905a(23) =23182313a(24) =49199819a(25) =104154950a(26) =220543471a(27) =465997148a(28) =984704560a(29) =2076988713
External references
- oeis: A293741