Number of sets 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.
A293965
Number of sets 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) =8a(2) =30a(3) =114a(4) =411a(5) =1462a(6) =5237a(7) =18998a(8) =70220a(9) =265010a(10) =1024692a(11) =4059100a(12) =16504058a(13) =68843340a(14) =294854550a(15) =1295771712a(16) =5843980456a(17) =27026394156a(18) =128135282356a(19) =622230803212
External references
- oeis: A293965