|
%I #13 Sep 21 2017 11:31:05
%S 1,1,3,10,47,246,1602,6441,35023,175510,1017158,5412111,33991322,
%T 168112907,982269641,5378704155,31714236863,174819971462,
%U 1082436507990,5756932808211,34302363988462,193719726696345,1150224854410151,6482217725030141,39812123155826626
%N Number of n-length words w over a 6-ary alphabet {a1,a2,...,a6} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a6) >= 0, where #(w,x) counts the letters x in word w.
%H Alois P. Heinz, <a href="/A226876/b226876.txt">Table of n, a(n) for n = 0..1000</a>
%p b:= proc(n, i, t) option remember;
%p `if`(t=1, 1/n!, add(b(n-j, j, t-1)/j!, j=i..n/t))
%p end:
%p a:= n-> n!*b(n, 0, 6):
%p seq(a(n), n=0..30);
%Y Column k=6 of A226873.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jun 21 2013
|
