Induction in general is very elegant. In this case, obviously, it requires strengthening the induction statement from to for some positive expression E(n). This method illustrates the reason for the inequality and shows how close the sum gets to 2. I would say this is very illuminating way of proving the inequality. Which E(n) did you use?
Another way is a standard trick from generating functions. Let . Then for (see Wikipedia), so .