|
A226889
|
|
Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 1, where #(w,x) counts the letters x in word w.
|
|
2
|
|
|
%I #8 Sep 25 2017 19:45:22
%S 3628800,19958400,199584000,1556755200,14045391360,116237721600,
%T 1096301606400,9944898163200,98823235230720,985768475852160,
%U 10494386800934400,88832292392188800,848327839539586560,7627235867290892160,71992606401661397760,656191923706230912000
%N Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 1, where #(w,x) counts the letters x in word w.
%H Alois P. Heinz, <a href="/A226889/b226889.txt">Table of n, a(n) for n = 10..1000</a>
%Y Column k=10 of A226874.
%K nonn
%O 10,1
%A _Alois P. Heinz_, Jun 21 2013
|
