Number of sets 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.

A293972

Number of sets 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) =120a(1) =2010a(2) =21082a(3) =169846a(4) =1173098a(5) =7286181a(6) =41993502a(7) =228997683a(8) =1198101638a(9) =6074435686a(10) =30073235682a(11) =146248264684a(12) =701957684114

External references