Number of sets of nonempty words with a total of n letters over ternary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A340410
Number of sets of nonempty words with a total of n letters over ternary 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) =36a(5) =122a(6) =433a(7) =1356a(8) =4449a(9) =15279a(10) =48567a(11) =158837a(12) =532415a(13) =1704777a(14) =5547148a(15) =18335536a(16) =58815602a(17) =190574866a(18) =623885902a(19) =2000945191a(20) =6459510350a(21) =20998728429a(22) =67275468661a(23) =216477522426a(24) =699952967976
External references
- oeis: A340410