Bounds on the number of squares in recurrence sequences

Abstract

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 very special conditions where we prove there are at most three such squares.