Number of sets 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.
A293964
Number of sets 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) =2a(1) =5a(2) =18a(3) =52a(4) =168a(5) =533a(6) =1792a(7) =6161a(8) =22088a(9) =81690a(10) =313224a(11) =1239532a(12) =5068320a(13) =21355130a(14) =92714368a(15) =413915690a(16) =1899260064a(17) =8941932948a(18) =43168351136a(19) =213385326440
External references
- oeis: A293964