Summation of Products of n Numbers taken m at a time with Repetitions/Inverse Formula/Examples/Degree 2

Example of Summation of Products of n Numbers taken m at a time with Repetitions: Inverse Formula
Let $a, b \in \Z$ be integers such that $b \ge a$.

Let $U$ be a set of $n = b - a + 1$ numbers $\left\{ {x_a, x_{a + 1}, \ldots, x_b}\right\}$.

Let $m \in \Z_{>0}$ be a (strictly) positive integer.

Let:

That is, $h_m$ is the product of all $m$-tuples of elements of $U$ taken $m$ at a time.

For $r \in \Z_{> 0}$, let:
 * $S_r = \displaystyle \sum_{j \mathop = a}^b {x_j}^r$

Then:
 * $S_2 = 2 h_2 - {h_1}^2$

Proof
From Summation of Products of n Numbers taken m at a time with Repetitions: Inverse Formula:
 * $S_m = \displaystyle \sum_{k_1 \mathop + 2 k_2 \mathop + \mathop \cdots \mathop + m k_m \mathop = m} \left({-1}\right)^{k_1 + k_2 + \cdots + k_m - 1} \dfrac {m \left({k_1 + k_2 + \cdots + k_m - 1}\right)! } {k_1! \, k_2! \, \cdots k_m!} {h_1}^{k_1} {h_2}^{k_2} \cdots {h_m}^{k_m}$

where:
 * $k_1 + 2 k_2 + \cdots + m k_m = m$

When $m = 2$ we have two possible sets of $k_j$ that meet the criterion:
 * $k_1 = 2, k_2 = 0$
 * $k_1 = 0, k_2 = 1$

Thus: