Number of multisets of exactly ten 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.

A294012

Number of multisets of exactly ten 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) =134594a(11) =512620a(12) =2002740a(13) =8037362a(14) =33121048a(15) =140282194a(16) =610324801a(17) =2728518748a(18) =12524236605a(19) =59013698416a(20) =285164364993

External references