Let $c_n \in \{ -1,1\}$. Here, it is stated that every natural number may be written as
$$\sum c_kk^2$$
Where $k$ runs from $1$ to some finite number. I am wondering whether every natural number $n$ can be written as follows:
$$n = \sum c_n(2k-1)^2.$$
In other words,
can every natural number be written as the sum of the first so-and-so signed odd squares?
Obviously, $1=1^2$. However, even to find such a writing of $2$, I needed eight squares: $$2=1+9+25-49+81-121-169+225$$ And could not find one for $3$. Any insight would be appreciated.