  We investigate the number of squares in a very broad family of binary
recurrence sequences with $u_{0}=1$. We show that there are at most two
distinct squares in such sequences (the best possible result), except under
such very special conditions where we prove there are at most three such
squares.
