Solving linear recursive equation $a_n = a_{n-1} + 2 a_{n-2} + 2^n$. I wish to solve the linear recursive equation:

$a_n = a_{n-1} + 2a_{n-2} + 2^n$, where $a_0 = 2$, $a_1 = 1$.

I have tried using the Ansatz method and the generating function method in the following way:
Ansatz method
First, for the homogenous part, $a_n = a_{n-1} + 2a_{n-2}$, I guess $a_n = \lambda^n$ as the solution, and substituting and solving for the quadratic, I get $\lambda = -1, 2$. So, $a_n = \alpha (-1)^n + \beta 2^n$. Then, for the inhomogenous part, I guess $a_n = \gamma 2^n$, to get $\gamma 2^n = \gamma 2^{n-1} + 2\gamma 2^{n-2} + 2^n$, whence $2^n=0$, which means, I suppose, that this guess is not valid. These are the kind of guesses that usually work, so I don't know why it fails in this particular case, and what to do otherwise, so I tried the generating function method.
Generating function method
Let
$$
A(z) = \sum_{i=0}^{\infty} a_k z^k
$$
be the generating function for the sequence $\{ a_n \}_{n \in \mathbb{N} \cup {0}}$. Then, I try to write down the recursive relation in terms of $A(z)$:
$$
A(z) = zA(z) + 2z^2 A(z) + \frac{1}{1-2z} + (1 - 2z),
$$
where the last term in the brackets arises because of the given initial conditions. Then, solving for $A(z)$,
$$
\begin{align}
A(z) &= \frac{1}{(1+z)(1-2z)^2} + \frac{1}{1+z}\\
&= \frac{2}{9}\frac{1}{1-2z} + \frac{2}{3}\frac{1}{(1-2z)^2} + \frac{10}{9}\frac{1}{1+z}\\
&=\frac{2}{9} \sum_{k=0}^{\infty} 2^k z^k + \frac{2}{3} \sum_{k=0}^{\infty} (k+1)2^k z^k + \frac{10}{9} \sum_{k=0}^{\infty} (-1)^k z^k\\
&= \sum_{k=0}^\infty \frac{(3k+4)2^{k+1} + (-1)^k 10}{9} z^k.
\end{align}
$$
So,
$$
a_k = \frac{(3k+4)2^{k+1} + (-1)^k 10}{9}.
$$
But then, $a_1 = 2$, whereas we started out with $a_1 = 1$.
At first, I thought that maybe the generating function method did not work because some of the series on the right hand side were not converging, but they all look like they're converging for $|z| < 1/2$. I rechecked my calculations several times, so I don't think there is any simple mistake like that. It would be great if someone could explain to me what exactly is going wrong here.

Using the characteristic equation method, we have the homogeneous part of the given equation,
$$g_n = g_{n-1} + 2g_{n-2}$$
As you have done, the roots of the characteristic equation are $2$ and $-1$, so the solution to the homogeneous part is $c_12^n + c_2(-1)^n$ for some constants $c_1$ and $c_2$. For the nonhomogeneous part, according to the comment by @AndreNicolas, we assume the solution is of the form $c_3n2^n$ and we can write:
$$c_3n2^n = c_3(n-1)2^{n-1} + 2c_3(n-2)2^{n-2} + 2^n \\
\implies c_3 = \frac{2}{3}$$
Note: We guess $c_3n2^n$ for the nonhomogeneous part, and not $c_32^n$, because $2$ is already a root of the characteristic equation of the homogeneous part. In the same way, when we have repeated roots for the homogeneous part (say the root $a$ appears thrice), we use $c_1a^n + c_2na^n + c_3n^2a^n$, etc.
Now,
$$\begin{align}
a_n &= h_n + n\frac{2 \cdot 2^n}{3} \\
&= c_12^n + c_2(-1)^n + \frac{2^{n+1}n}{3}
\end{align}$$
and by substituting for $a_0$ and $a_1$, we get $c_1 = \frac{5}{9}$, $c_2 = \frac{13}{9}$, and
$$a_n = \frac{5\cdot 2^n}{9} + \frac{13 \cdot (-1)^n}{9} + \frac{2^{n+1}n}{3}$$
