Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.
A226874
Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =1a(8) =3a(9) =6a(10) =0a(11) =1a(12) =10a(13) =12a(14) =24a(15) =0a(16) =1a(17) =15a(18) =50a(19) =60a(20) =120a(21) =0a(22) =1a(23) =41a(24) =180a(25) =300a(26) =360a(27) =720a(28) =0a(29) =1
External references
- oeis: A226874