Let F_n be the n-th Fibonacci number, and let a_n=F^2_n. Hadamard’s product theorem implies that the generating function for the sequence {a_n} must be rational. Find this linear recurrence relation. The first few terms of the sequence a_n are easy to calculate: 1, 1, 4, 9, 25, 64, 169, 441, 1156, 3025, 7921, 20736, 54289, …
