View source for L(n)=F(n+1)+F(n-1)

==Theorem==
The following formula holds:
$$L(n)=F(n+1)+F(n-1),$$
where $L(n)$ denotes a [[Lucas numbers|Lucas number]] and $F(n)$ denotes a [[Fibonacci numbers|Fibonacci number]].

==Proof==

==References==
* {{PaperReference|A Primer on the Fibonacci Sequence Part I|1963|S.L. Basin|author2=V.E. Hoggatt, Jr.|prev=L(n+1)L(n-1)-L(n)^2=5(-1)^(n+1)|next=F(2n+1)=F(n+1)^2+F(n)^2}} 

[[Category:Theorem]]
[[Category:Unproven]]