Number of multisets of exactly nine nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A294011
Number of multisets of exactly nine nonempty words with a total of n letters over n-ary 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) =2a(2) =7a(3) =22a(4) =73a(5) =240a(6) =818a(7) =2824a(8) =10004a(9) =36252a(10) =134583a(11) =512580a(12) =2002550a(13) =8036582a(14) =33117812a(15) =140269222a(16) =610272640a(17) =2728310488a(18) =12523401416a(19) =59010337316a(20) =285150731417
External references
- oeis: A294011