  We derive two formulas for the weighted sums of rooted spanning forests of
particular sequence of graphs by using the matrix tree theorem. We consider
cycle graphs with edges so called the pendant edges. One of our formula can be
described as a variable transformation of the Chebyshev polynomial. They have
particular algebraic properties.
