Inverse Rule for Formal Power Series I am just really starting to get into formal power series and understanding them.  I'm particularly interested in looking at the coefficients generated by the inverse of a formal power series:
$$\left(\sum_{n\ge 0}a_nx^n\right)^{-1}=\sum_{n\ge 0}b_nx^n$$
I first thought that my approach would be looking at 
$$\frac{1}{\sum_{n\ge 0}a_nx^n}$$
But I'm more thinking that since we know that a series is invertible in the ring if $a_0$ is invertible in the ring of coefficients.  Thus, since if we assume it is, and since the unit series is $\{1,0,0,0,....\}$ then we have
$$\left(\sum_{n\ge 0}a_nx^n\right)\left(\sum_{n\ge 0}b_nx^n\right)=1$$
Thus we know that $a_0b_0=1$ and thus $b_0=\frac1{a_0}$.  And for the remaining terms we are just looking at the convolution generated by the Cauchy Product and so
$$0=\sum_{j=0}^ka_jb_{k-j}$$
$$-a_0b_k=\sum_{j=1}^ka_jb_{k-j}$$
$$b_k=\frac{-1}{a_0}\sum_{j=1}^ka_jb_{k-j}$$
And thus we have a recursive definition.
Is there another approach that defines the numbers $b_k$ without recursive means?  Are you forced to only recursive methods when operating on the ring of formal power series to calculate coefficents?

As closed a form as I could get I posted here. It looks pretty ugly... but I'm not sure how much prettier it can get.
