No label defined (Q4456575)

Fibonacci numbers \(F_n\) and Lucas numbers \(L_n\) are defined recursively by \(F_{n+2}= F_{n+1}+ F_n\) with \(F_0= 0\), \(F_1=1\) and \(L_{n+2}= L_{n+1}+ L_n\) with \(L_0= 2\), \(L_1=1\), respectively. \textit{P. Filipponi} and \textit{O. Brugia} [Fibonacci Q. 37, No. 3, 262--264 (1999; Zbl 0949.11008)] asked which \(F_n\) and \(L_n\) are of the form \(n(n-1)-1\). By the famous Thue theorem, it is easy to verify that there are only finitely many such \(F_n\) and \(L_n\). In this paper, using elementary methods, the author shows that if \(L_n\) is of the above form, then \(L_n\equiv\pm1\pmod{16}\) except for \(L_5=11\) and \(L_7=29\). Note that, as indicated by Filipponi and Brugia, the fact that \(L_n\) with even \(n\) cannot be such a number, is evident.