Number of sets of nonempty words with a total of n letters over binary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A340409
Number of sets of nonempty words with a total of n letters over binary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =7a(4) =18a(5) =42a(6) =110a(7) =250a(8) =627a(9) =1439a(10) =3523a(11) =8063a(12) =19374a(13) =44274a(14) =104816a(15) =238976a(16) =559171a(17) =1271295a(18) =2946901a(19) =6679741a(20) =15363719a(21) =34719631a(22) =79335385a(23) =178749829a(24) =406164359a(25) =912475815a(26) =2063298409a(27) =4622461673a(28) =10407679805a(29) =23254807241
External references
- oeis: A340409