Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows.
A320264
Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =11a(5) =9a(6) =4a(7) =38a(8) =84a(9) =52a(10) =7a(11) =125a(12) =523a(13) =766a(14) =365a(15) =10a(16) =364a(17) =2676a(18) =7096a(19) =7775a(20) =3006a(21) =16a(22) =1041a(23) =12435a(24) =52955a(25) =100455a(26) =87261a(27) =28357a(28) =22a(29) =2838
External references
- oeis: A320264