Representing $x$ as a linear combination of higher powers $x^n$ Applying the Müntz–Szász theorem on $[0,1]$ repeatedly, we can represent
$$
x= \sum_{n\geq 2} c_n x^n
$$ 
as a uniformly convergent series (edit: only over some subsequence, see edits below) on $[0,1]$ of higher powers $x^n$ for $n\geq 2$. What can one say about the coefficients? Is there an explicit choice of $c_n$?
Edit: Comments below suggest that this is not possible. What is wrong with the following argument? Take $\epsilon>0$ and approximate $x$ by a finite combination of higher powers and a constant uniformly with an error $\epsilon/2.$ Plugging  $x=0$ we see that the constant is smaller than $\epsilon/2$ so dropping it we get an approximation up to $\epsilon$ by a finite sum $\sum_{n=2}^{N_1} c_n x^n.$ Next, consider $x-\sum_{n=2}^{N_1} c_n x^n$ and approximate it by a linear combination $\sum_{n=N_1+1}^{N_2} c_n x^n$ up to an error $\epsilon/2.$ This gives us an $\epsilon/2$-approximation $\sum_{n=1}^{N_2}c_n x^n.$ Continue this construction repeatedly.
Edit II: Theorem holds for $a=0$ if we include constants, but Robert Israel's comment below contained the main point: the series only converges over some subsequence $(N_k)_{k\geq 1}$ as in the above construction. Let me rephrase the question accordingly:
Is there anything interesting one can say about $c_n$? Can one choose the subsequence and $c_n$ in a way that $(c_n)\in\ell^p$ for some $p$, or uniformly bounded?
 A: It can't be in $\ell^p$ or bounded, in fact you can't have $|c_n| = O(t^{-n})$ for any $t > a$ where the subsequence converges on $[a,1]$. This is because if $|c_n| = O(t^{-n})$, $\sum_n c_n z^n$ is analytic in $|z|<t$, and by uniqueness...
A: [Sorry -- too long for a comment]. It has already been pointed out that if you want 0 in your domain then you'll have to use constant functions too. But even then the theorem does not say what you seem to think it says: it only says that we can approximate $f(x)=x$ arbitrarily well by such a power series -- and as the approximation gets better and better the terms might jump around like crazy. In particular the coefficients are not really well-defined. As one way of seeing this, take one expansion which is very close to $x$ and let's assume the coefficient of $x^7$ is non-zero. Then remove 7 from your set of allowable powers of $x$ and the theorem again says that one can approximate $x$ arbitrarily well; this time the coefficient of $x^7$ is forced to be zero.
