Number of sets of exactly seven 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.
A293969
Number of sets of exactly seven 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) =40a(2) =394a(3) =2766a(4) =16251a(5) =86162a(6) =426894a(7) =2021990a(8) =9290152a(9) =41829426a(10) =185965908a(11) =820999576a(12) =3615595261a(13) =15941247432a(14) =70583512572a(15) =314664832674
External references
- oeis: A293969