|
%I #8 Sep 25 2017 19:48:28
%S 362880,1814400,16632000,119750400,1003242240,7749181440,68518850400,
%T 584994009600,5490179735040,51882551360640,405925296678720,
%U 3438148872412800,28858842800988480,242180235433825920,2068546823359410240,17716539920908308480,155272065377761886400
%N Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 1, where #(w,x) counts the letters x in word w.
%H Alois P. Heinz, <a href="/A226888/b226888.txt">Table of n, a(n) for n = 9..1000</a>
%Y Column k=9 of A226874.
%K nonn
%O 9,1
%A _Alois P. Heinz_, Jun 21 2013
|
