This answer uses the same sort of reasoning as given in the answer by zyx. I show that we can get a bit more out of the recursion relation satisfied by the function $S(n)$ and their generalizations for summation of arbitrary powers, in particular that $S(t)$ (and its generalization for summations over odd powers larger than 1) contains a factor $t^2 (1+t)^2$. This then immediately establishes the result.
We start with defining the functions $S_k(n)$:
$$ S_k(n) =\sum_{r=0}^{n}r^k \tag{1}$$
where $k$ and $n$ are integers and we take $k\geq 1$ and $n\geq 0$. The functions $S_k(n)$ satisfy the recursion:
$$ S_k(n) - S_k(n-1) = n^k \tag{2}$$
This recursion together with the condition that $S_k(0) = 0$ which follows from (1), fixes the function $S_k(n)$. In particular, it follows from this that $S_k(n)$ is a polynomial of degree $k+1$ in $n$. This means that we can lift the constraint that $n$ be an integer larger than or equal to zero and instead take $n$ to be any arbitrary real or complex number.
If we put $n = 0$ in (2) and use that $S_k(0) = 0$, we find:
$$S_k(-1) = 0$$
The function $S_k(x)$ is therefore a polynomial of degree $k+1$ which contains a factor of $x (x+1)$. Since $S_1(x)$ is a second degree polynomial, this fixes $S_1(x)$ up to a constant factor, and we can find that this factor is $\frac{1}{2}$ by using $S_k(1) = 1$, although that's not necessary to do for the purpose of this problem.
We can find a symmetry relation satisfied by $ S_k(n)$ using the recursion (2) as follows. We replace $n$ by $-n$ to obtain:
$$ S_k(-n) - S_k(-n-1) = (-1)^k n^k $$
Let’s define the function $\tilde{S}_{k}(n) = S_k(-n)$. We can then write the above recursion as:
$$ \tilde{S}_k(n+1) - \tilde{S}_k(n) = (-1)^{k+1} n^k $$
We then see that the function $(-1)^{k+1}\tilde{S}_k(n+1)$ satisfies the same recursion as the function $S_k(n)$. The value at $n = 0$ is equal to zero, because $\tilde{S}_k(1)= S_k(-1) = 0$. This means that these two functions are identical. We thus have:
$$ S_k(-x-1) = (-1)^{k+1}S_k(x)$$
The point at which $x = -x - 1$ is $x = -\frac{1}{2}$. We see that for even $k$, $S_k(x)$ is anti-symmetric w.r.t. reflection about this point, while in case of odd $k$, it is symmetric. This means that for even $k$, the function has a zero there, while for odd $k$ the derivative is zero:
$$ \begin{split}S_{2k}\left(-\frac{1}{2}\right) &= 0\\ S'_{2k+1}\left(-\frac{1}{2}\right) &= 0\end{split}$$
This fixes $S_2(x)$, because $S_2(x)$ is a third degree polynomial and it has zeros at $x = 0$, $x = 1$ and $x = -\frac{1}{2}$, so it’s proportional to $x (x+1)(2x+1)$, and demanding that $S_2(1) = 1 $ yields $S_2(x) = \frac{1}{6} x (x+1)(2x+1)$. Obtaining this expression is, however, not necessary for the purpose of this problem.
In general, we have that $S_{2k}(x)$ contains a factor of $x(x+1)(2x+1)$.
We can obtain more information about $S_k(x)$ for odd $k$ by taking the derivative of the recursion (2). This yields:
$$ S'_{2k+1}(x) - S'_{2k+1}(x-1) = (2k+1) x^{2k}$$
We then see $\frac{S'_{2k+1}(x)}{2k+1}$ satisfies the same recursion as $S_{2k}(x)$. Because both these functions are zero at $x = -\frac{1}{2}$, they are identical. The fact that $S_{2k}(x)$ is zero at $x = 0$ and $x = 1$ then tells us that $ S'_{2k+1}(x)$ is zero there as well. So, we see $S_{2k+1}(x)$ has zeros at $x = 0$ and $ x = 1$ of multiplicity of at least $2$, so $S_{2k+1}(x)$ contains a factor of $x^2 (x+1)^2$.
In particular, since $S_3(x)$ is a fourth degree polynomial, we see that it is proportional to $x^2(x+1)^2$, so it's proportional to $ S_1(x)^2$. And since $ S_k(1) =1 $for all $k$, we have $S_3(x) = S_1(x)^2$.