Newton sum rules of polynomials defined by a three-term recurrence relation

We derive a general formula for computing the Newton sum rules of every polynomial belonging to a given polynomial set. We use the following tools: a recursive computation of the coefficients of the given polynomial in terms of the coefficients of the three-term recurrence relation, the generalized Lucas polynomials of the first kind, and last, the Newton-Girard formulas.