Number of sets of nonempty words with a total of n letters over senary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A340413
Number of sets of nonempty words with a total of n letters over senary 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) =13a(4) =60a(5) =326a(6) =2065a(7) =9468a(8) =51325a(9) =268339a(10) =1534485a(11) =8421447a(12) =51259855a(13) =271291165a(14) =1568129440a(15) =8793678911a(16) =51467662027a(17) =290934776639
External references
- oeis: A340413