Number of multisets of exactly two 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.
A294004
Number of multisets of exactly two 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) =18a(4) =56a(5) =168a(6) =543a(7) =1792a(8) =6187a(9) =22088a(10) =81766a(11) =313224a(12) =1239764a(13) =5068320a(14) =21355894a(15) =92714368a(16) =413918310a(17) =1899260064a(18) =8941942444a(19) =43168351136a(20) =213385362136
External references
- oeis: A294004