I have a nice family of functions of the form:
W:=(p,n,mu,w)->sum(w[k] * (n-k)p * mu(n-k),k=1..n)
which can be evaluated for different p's using the operator mu*diff(...,mu)
The recursion begins with p=0 and proceeds using mu*diff(W(p,n,mu,w),mu) = W(p+1,n,mu,w).
Can anybody implement this procedure in Maple