Number of multisets of exactly n nonempty words with a total of 2n letters over 2n-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.
A293809
Number of multisets of exactly n nonempty words with a total of 2n letters over 2n-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) =512632a(12) =2002797a(13) =8037634a(14) =33122211a(15) =140287074a(16) =610344666a(17) =2728599114a(18) =12524559427a(19) =59014996342a(20) =285169596358
External references
- oeis: A293809