Considering the one parameter Mittag-Leffler function,

$$E_{\alpha}(z)=\sum_{k=0}^\infty\frac{z^{k}}{\Gamma(\alpha k+1)}, \Re(\alpha)>0$$

Considering then the generating function for $E_\alpha(z^\alpha)$, we see that is

$$E_\alpha(z^\alpha)=\frac{1}{\alpha}\sum_{k=0}^{\alpha -1}\exp(w_{\alpha}^kz)$$

where $w_\alpha=\exp(2i\pi/\alpha)$.

I want to study the coefficients then of powers of this function; in other words,

$$[E_\alpha(z^\alpha)]^n=\sum_{k=0}^\infty{A(n,k)\frac{z^k}{k!}}$$

I know that I can use the multinomial formula to write $[E_\alpha(z^\alpha)]^n$ as

$$\left[\frac{1}{\alpha}\sum_{k=0}^{\alpha -1}\exp(w_{\alpha}^kz)\right]^n=\frac{1}{\alpha^n}\sum_{k_0+...+k_{\alpha-1}=n}\binom{n}{k_0,...,k_{\alpha-1}}\exp((w_{\alpha}^0k_0+...+w_{\alpha}^{\alpha-1}k_{\alpha-1})x)$$ $$=\frac{1}{\alpha^n}\sum_{k_0+...+k_{\alpha-1}=n}\binom{n}{k_0,...,k_{\alpha-1}}\sum_{j=0}^\infty{(w_{\alpha}^0k_0+...+w_{\alpha}^{\alpha-1}k_{\alpha-1})^j}\frac{x^j}{j!}$$ $$=\sum_{j=0}^\infty\frac{1}{\alpha^n}\sum_{k_0+...+k_{\alpha-1}=n}\binom{n}{k_0,...,k_{\alpha-1}}{(w_{\alpha}^0k_0+...+w_{\alpha}^{\alpha-1}k_{\alpha-1})^j}\frac{x^j}{j!}$$

I could keep going, and again use the multinomial formula for $(w_{\alpha}^0k_0+...+w_{\alpha}^{\alpha-1}k_{\alpha-1})^j$ and use elementary recursive methods to get a recursive formula. But this seems like a very longwinded approach. Are there other methods to come up with a recursive formula for these coefficients or is this standard approach the preferred method? Is there a combinatoric approach that I could use?