Well, if you proceed using the ansatz (thanks @user33640 for the "correction")
$$
y(x) = \sum_{n=0}^N a_n x^n
$$
and substitute it directly in the equation, you end up with
$$
x^3 \sum_{n=1}^N n a_n x^{n-1} = \sum_{n=0}^N a_n x^{2n}.
$$
This means that
$$
\sum_{n=1}^N n a_n x^{n+2} - \sum_{n=0}^N a_n x^{2n} = 0
$$
which tells you that all $a_n = 0$ for $n=2m+1$. This in turn help us to propose an improved ansatz
$$
y(x) = \sum_{n=0}^N b_{2n} x^{2n}.
$$
Again, substituting in the ode, we have
$$
\sum_{n = 1}^N 2n b_{2n} x^{2n+2} = \sum_{n=0}^N b_{2n} x^{4n}
$$
Now, the only way to this equation to be satisfied, is if
$$
2N + 2 = 4N \quad \Longrightarrow \quad N=1
$$
Then $y(x) = b_0 + b_2 x^2$ implies that
$$
2 b_2 x^4 = b_0 + b_2 x^4
$$
which means $b_0 = b_2 = 0$ hence no non-trivial solution exist.