There are many ways to evaluate this sum, but I will use the approach that I came up with when I was in high school. This will be a natural approach that anyone can come up with.
$$S_n:=\sum_{k=1}^n k^2=\sum_{k=1}^n k\times k=\sum_{k=1}^nk(k-1)+\sum_{k=1}^nk$$
It is well known that $\sum\limits_{k=1}^nk=\frac{n(n+1)}{2}$, so the real problem is $\sum\limits_{k=1}^nk(k-1)$. Since $\dbinom{n}{2} =\frac{n(n-1)}{2}$, then
$$\sum_{k=1}^nk(k-1)= 2\sum_{k=1}^n\frac{k(k-1)}{2}=2\sum_{k=3}^n \dbinom{k}{2}+\frac{1\times 0}{2}+ 1$$
Since $\displaystyle\dbinom{n}{2}+\dbinom{n}{3}= \frac{n!}{2!(n-3)!}\bigg(\frac{1}{n-2}+\frac{1}{3}\bigg)=\frac{n!}{2!(n-3)!}\bigg(\frac{n+1}{(n-2)(3)}\bigg)=\dbinom{n+1}{3} $, then
$$\sum_{k=1}^n\frac{k(k-1)}{2}= 1+ \sum_{k=3}^n \dbinom{k}{2}=\dbinom{3}{3}+ \sum_{k=3}^n \dbinom{k}{2}$$
Now the term $\dbinom{3}{3}$ will "eat" $\sum\limits_{k=3}^n \dbinom{k}{2}$ as follows:
$\\[10pt]$
$$\dbinom{3}{3}+\sum_{k=3}^3\dbinom{k}{2}=\dbinom{3}{3}+\dbinom{3}{2}= \dbinom{4}{3}$$
$$\dbinom{3}{3}+\sum_{k=3}^4\dbinom{k}{2}=\dbinom{4}{3}+ \dbinom{4}{2}=\dbinom{5}{3}$$
$$\dbinom{3}{3}+\sum_{k=3}^5\dbinom{k}{2}=\dbinom{5}{3}+ \dbinom{5}{2}=\dbinom{6}{3}$$
$$.$$
$$.$$
$$.$$
$$\dbinom{3}{3}+\sum_{k=3}^n\dbinom{k}{2}=\dbinom{n}{3}+ \dbinom{n}{2}=\dbinom{n+1}{3}$$
$\\[10pt]$
So $\displaystyle\sum_{k=1}^n{k(k-1)}= 2\dbinom{n+1}{3}=\frac{(n+1)(n)(n-1)}{3}$
$$S_n= \frac{n(n+1)(n-1)}{3}+ \frac{n(n+1)}{2}= \frac{n(n+1)}{6 }\bigg( 2(n-1)+3 \bigg)= \frac{n(2n+1)(n+1)}{6}$$
It is worth mentioning that this approach can work for any $i \in \mathbb{N} $ to evaluate $\sum\limits_{k=1}^n k^i$. When I was in high school I was able to to find the sum up to $i=6$ by this approach.