How can I evaluate $\sum_{n=0}^\infty(n+1)x^n$?

No need to use Taylor series, this can be derived in a similar way to the formula for geometric series. Let's find a general formula for the following sum: $$S_{m}=\sum_{n=1}^{m}nr^{n}.$$

Notice that \begin{align*} S_{m}-rS_{m} & = -mr^{m+1}+\sum_{n=1}^{m}r^{n}\\ & = -mr^{m+1}+\frac{r-r^{m+1}}{1-r} \\ & =\frac{mr^{m+2}-(m+1)r^{m+1}+r}{1-r}. \end{align*}
Hence $$S_m = \frac{mr^{m+2}-(m+1)r^{m+1}+r}{(1-r)^2}.$$
This equality holds for any $r$, but in your case we have $r=\frac{1}{3}$ and a factor of $\frac{2}{3}$ in front of the sum. That is \begin{align*} \sum_{n=1}^{\infty}\frac{2n}{3^{n+1}} & = \frac{2}{3}\lim_{m\rightarrow\infty}\frac{m\left(\frac{1}{3}\right)^{m+2}-(m+1)\left(\frac{1}{3}\right)^{m+1}+\left(\frac{1}{3}\right)}{\left(1-\left(\frac{1}{3}\right)\right)^{2}} \\ & =\frac{2}{3}\frac{\left(\frac{1}{3}\right)}{\left(\frac{2}{3}\right)^{2}} \\ & =\frac{1}{2}. \end{align*}

Added note:

We can define $$S_m^k(r) = \sum_{n=1}^m n^k r^n.$$ Then the sum above considered is $S_m^1(r)$, and the geometric series is $S_m^0(r)$. We can evaluate $S_m^2(r)$ by using a similar trick, and considering $S_m^2(r) - rS_m^2(r)$. This will then equal a combination of $S_m^1(r)$ and $S_m^0(r)$ which already have formulas for.

This means that given a $k$, we could work out a formula for $S_m^k(r)$, but can we find $S_m^k(r)$ in general for any $k$? It turns out we can, and the formula is similar to the formula for $\sum_{n=1}^m n^k$, and involves the Bernoulli numbers. In particular, the denominator is $(1-r)^{k+1}$.


If you want a solution that doesn't require derivatives or integrals, notice that \begin{eqnarray} 1+2x+3x^2+4x^3+\dots = 1 + x + x^2 + x^3 + \dots \\ + x + x^2+ x^3 + \dots\\ + x^2 + x^3 + \dots \\ +x^3 + \dots \\ + \dots \\ =1 + x + x^2 + x^3+\dots \\ +x(1+x+x^2+\dots) \\ +x^2(1+x+\dots)\\ +x^3(1+\dots)\\ +\dots \\ =(1+x+x^2+x^3+\dots)^2=\frac{1}{(1-x)^2} \end{eqnarray}


As indicated in other answers, you can reduce this to summing $\displaystyle{\sum_{n=1}^\infty na^n}$ with $|a|<1$ (by pulling out the constant $\frac{2}{3}$ and rewriting with $a=\frac{1}{3}$). This in turn can be reduced to summing geometric series by rearranging and factoring. Note that, assuming everything converges nicely (which it does):

$\begin{matrix} &a & + & 2a^2 & + & 3a^3 &+& 4a^4 &+& \cdots\\ =&a &+& a^2 &+& a^3 &+& a^4 &+& \cdots\\ +& & & a^2 &+& a^3 &+& a^4 &+& \cdots\\ +& & & & & a^3 &+& a^4 &+& \cdots\\ +& & & & & & & a^4 &+& \cdots\\ +& & & & & & & & & \vdots \end{matrix}$

Factoring out the lowest power of $a$ in each row yields

$\begin{align*} \sum_{n=1}^\infty na^n &= a(1+a^2+a^3+\cdots)\\ &+ a^2(1+a^2+a^3+\cdots)\\ &+ a^3(1+a^2+a^3+\cdots)\\ &+ a^4(1+a^2+a^3+\cdots)\\ &\vdots \end{align*}$

Each row in the last expression has the common factor $a(1+a+a^2+a^3+\cdots)$, and factoring this out yields

$\begin{align*}\sum_{n=1}^\infty na^n &=a(1+a+a^2+a^3+\cdots)(1+a+a^2+a^3+\cdots)\\ &=a(1+a+a^2+a^3+\cdots)^2.\end{align*}$

Now you can finish by summing the geometric series.

Eric Naslund's answer was posted while I was writing, but I thought that this alternative approach might be worth posting. I also want to mention that in general one should be careful about rearranging series as though they were finite sums. To be more formal, some of the steps above would require justification based on absolute convergence.