Number of multisets of exactly three 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.
A294005
Number of multisets of exactly three 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) =68a(5) =218a(6) =721a(7) =2438a(8) =8491a(9) =30478a(10) =112524a(11) =428382a(12) =1678600a(13) =6778708a(14) =28169286a(15) =120516092a(16) =530081370a(17) =2396797920a(18) =11125584584a(19) =52993063796a(20) =258676491628
External references
- oeis: A294005