Although the method via differentiating the known power series is what I'd recommend, here's a direct argument why $(\sum_{n=0}^{\infty}5^nx^n)^2=\sum_{n=0}^{\infty}(n+1)5^nx^n$ or more simply why
$$(\sum_{k=0}^{\infty}x^k)^2=\sum_{n=0}^{\infty}(n+1)x^n.$$
The left-hand-side is
$$(x^0 + x^1 + x^2 + \cdots + x^k + \cdots) \times (x^0 + x^1 + x^2 + \cdots + x^l + \cdots),$$
so the coefficient of $x^n$ in the LHS is the number of pairs $(k, l)$ with $k + l = n$. This is $n+1$, as there are $n+1$ pairs $(0,n), (1,n-1), \dots, (n,0)$. This is the same as the coefficient of $x^n$ in the RHS.
We can also give it a combinatorial interpretation: $F(x) = \sum_{n=0}^{\infty} x^n$ is the generating function for the nonnegative integers, and so $F(x)^2$ is the generating function for the number of ways of writing an integer as the sum of two nonnegative integers, which is $n+1$ (by the argument above).