Here's how I would approach the problem. We have three variables $a, b, c$ which are all conveniently non-negative and sum to $n$, so it is clear that we want something of the form
$$
G(x) = (a_0 + a_1x + a_2x^2 + \cdots)(b_0 + b_1x + b_2x^2 + \cdots)(c_0 + c_1x + c_2x^2 + \cdots)
$$
This way, we have $[x^n]G(x) = \sum_{i + j + k = n \\ i, j, k \in \mathbb{Z}_{\geq 0}} a_ib_jc_k$.
Hopefully now it becomes simple. If you still don't see it, note that $a_i$ just means a function in $i$, so you can write $a(i)$ if it's clearer. Then look at your summand $\frac{a^2b}{c}$ and see how it corresponds to $a_ib_jc_k$.
Also, if you don't know how to find the coefficient from this power series, I have written an answer on solving generating functions literally a week ago. You can find it here.
Hope this helps!