Number of sets of nonempty words with a total of n letters over n-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A292796
Number of sets of nonempty words with a total of n letters over n-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =13a(4) =60a(5) =326a(6) =2065a(7) =14508a(8) =116845a(9) =1039459a(10) =10339365a(11) =112376487a(12) =1339665295a(13) =17256611005a(14) =240193792120
External references
- oeis: A292796