On combinatorial compexity of convex sequences

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.