Number of sets of exactly six 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.
A293968
Number of sets of exactly six 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) =4a(1) =62a(2) =417a(3) =2414a(4) =12190a(5) =57686a(6) =260349a(7) =1143710a(8) =4936266a(9) =21117128a(10) =90035798a(11) =384416432a(12) =1649398948a(13) =7133455202a(14) =31173583589a(15) =137947781614a(16) =619247938106
External references
- oeis: A293968