Number of 2n-length words w over an n-ary alphabet {a1, a2, ..., an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,an) >= 1, where #(w,x) counts the letters x in word w.

A318796

Number of 2n-length words w over an n-ary alphabet {a1, a2, ..., an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,an) >= 1, where #(w,x) counts the letters x in word w.

Terms

    a(0) =1a(1) =1a(2) =10a(3) =180a(4) =6496a(5) =322560a(6) =25098480a(7) =2437475040a(8) =322951749120

External references