Number of multisets 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.
A292718
Number of multisets 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) =4a(3) =14a(4) =43a(5) =139a(6) =495a(7) =1544a(8) =5111a(9) =17348a(10) =55520a(11) =181946a(12) =607300a(13) =1951262a(14) =6362769a(15) =20972812a(16) =67451405a(17) =218884282a(18) =715353298a(19) =2298626230a(20) =7429125757a(21) =24124615697a(22) =77400570114a(23) =249285637563a(24) =805472940377
External references
- oeis: A292718