When given an ODE of the form $F(x, y, y', \ldots, y^{(n)}) = 0$, where $F$ is an elementary function, chances are that it has no solution of the form $y = G(x, c_1, \ldots, c_n)$, where $G$ is also elementary.
But how about the inverse? I.e. given a parametric family of functions $y = G(x, c_1, \ldots, c_n)$, where $G$ is elementary, is there always an ODE $F(x, y, y', \ldots, y^{(m)}) = 0$, where $m\geq n$, such that $G$ satisfies it?
In simple cases it is easy to produce $F$ by differentiating and getting rid of the constants. But if $G$ is complicated and has multiple repetitions of the constants, it is not evident that this will work. I was wondering if you are aware of any positive or negative result in this direction (ideally with a pointer to some corresponding algorithm like e.g. the Risch algorithm for integrals), or a simple solution I am not seeing.
*Note that it is ok for the degree of $F$ to be much larger than the number of constants, thus the solution may not be exactly $G$, but a broader family which contains it.