Number of multisets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

A293111

Number of multisets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter 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) =10a(3) =58a(4) =439a(5) =3767a(6) =37481a(7) =405672a(8) =4816390a(9) =60748286a(10) =817467196a(11) =11533898929a(12) =170979909037

External references