Abstract: The identity for the sum of the first n squares is well-known as an introductory exercise in induction. But that doesn't "really" explain it. I shall present a combinatorial proof of the result which is essentially a "picture proof", and as such goes much further to giving a satisfying insight into the identity. I shall also show how the same method yields visualizable proofs of several other power sum identities.