A new combinatorial interpretation of the Fibonacci numbers squared

We consider the tiling of an n-board (a 1 × n array of square cells of unit width) with half-squares (1/2× 1 tiles) and (1/2,1/2)-fence tiles. A (1/2,1/2 )-fence tile is composed of two half-squares separated by a gap of width 1/2. We show that the number of ways to tile an n-board using these types of tiles equals F_n²₊₁ where Fn is the nth Fibonacci number. We use these tilings to devise combinatorial proofs of identities relating the Fibonacci numbers squared to one another and to other number sequences. Some of these identities appear to be new.