116237721600domain: NAppears in sequencesa(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).at n=13A082569Number 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.at n=5A226889