Often, students will try to 'prove' a propositon by checking some examples and 'concluding' that it will be true for all $n \in N$.
I'm looking for some good, non-trivial examples from highschool and lower college mathematics showing that checking a finite number of cases is generally not sufficient. There is already a similar thread with examples from higher level math (Examples of apparent patterns that eventually fail).
The best non-trivial example I currently have to show this fallacy is:
3 is odd and prime
5 is odd and prime
7 is odd and prime
11 is odd and prime
13 is add and prime
therefore, all odd numbers are prime. :/
Counter example

One well-known example is the statement that $n^2 - n + 41$ is prime for $n \in \mathbb{Z}^{+}$.
Further historical remarks can be found here.
Note, in particular, that this is prime for $1 \leq n \leq 40$, but since $n^2 - n + 41 = n(n-1) + 41$, it is clear that the number is composite when $n = 41$ (and, incidentally, $42$).