OFFSET
0,1
COMMENTS
This is the sequence defined by the third-order non-linear recurrence a(n+1) = a(n)*a(n-1) - a(n-2) and a(0)=2, a(1)=3, a(2)=3.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..17
René Gy, Sequence in which adding 2 produces a square, Math StackExchange.
MATHEMATICA
Table[LucasL[2 Fibonacci[n]], {n, 0, 10}]
RecurrenceTable[{a[0]==2, a[1]==a[2]==3, a[n+1]==a[n]a[n-1]-a[n-2]}, a, {n, 20}] (* Harvey P. Dale, Mar 28 2020 *)
PROG
(PARI) a(n)={my(t=2*fibonacci(n)); fibonacci(t + 1) + fibonacci(t - 1)} \\ Andrew Howroyd, Mar 01 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
René Gy, Nov 23 2018
EXTENSIONS
Terms a(11) and beyond from Andrew Howroyd, Mar 01 2020
STATUS
approved