Number T(n,k) of multisets of exactly k 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; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A293808
Number T(n,k) of multisets of exactly k 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; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =1a(6) =0a(7) =4a(8) =2a(9) =1a(10) =0a(11) =10a(12) =7a(13) =2a(14) =1a(15) =0a(16) =26a(17) =18a(18) =7a(19) =2a(20) =1a(21) =0a(22) =76a(23) =56a(24) =22a(25) =7a(26) =2a(27) =1a(28) =0a(29) =232
External references
- oeis: A293808