Number of multisets of nonempty words with a total of n letters over ternary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A293733
Number of multisets of nonempty words with a total of n letters over ternary 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) =3a(3) =7a(4) =19a(5) =48a(6) =131a(7) =348a(8) =954a(9) =2607a(10) =7212a(11) =19995a(12) =55816a(13) =156246a(14) =439267a(15) =1238397a(16) =3502004a(17) =9927260a(18) =28208628a(19) =80322048a(20) =229161413a(21) =654966245a(22) =1875074366a(23) =5376298225a(24) =15437286706a(25) =44385247519a(26) =127776425727a(27) =368276055467
External references
- oeis: A293733