This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A316275 #46 Mar 28 2020 15:12:07
%S A316275 2,3,3,7,18,123,2207,271443,599074578,162614600673847,
%T A316275 97418273275323406890123,15841633607002416873831447357889638603,
%U A316275 1543264591854508694059691789796980188767738307671225999544322
%N A316275 Lucas analog to A101361.
%C A316275 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.
%H A316275 Andrew Howroyd, <a href="/A316275/b316275.txt">Table of n, a(n) for n = 0..17</a>
%H A316275 René Gy, <a href="https://math.stackexchange.com/a/3007124/130022">Sequence in which adding 2 produces a square</a>, Math StackExchange.
%F A316275 a(n) = A000032(2*A000045(n)) = Lucas(2*Fibonacci(n)).
%t A316275 Table[LucasL[2 Fibonacci[n]], {n, 0, 10}]
%t A316275 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 *)
%o A316275 (PARI) a(n)={my(t=2*fibonacci(n)); fibonacci(t + 1) + fibonacci(t - 1)} \\ _Andrew Howroyd_, Mar 01 2020
%Y A316275 Cf. A000032, A000045, A101361.
%K A316275 nonn
%O A316275 0,1
%A A316275 _René Gy_, Nov 23 2018
%E A316275 Terms a(11) and beyond from _Andrew Howroyd_, Mar 01 2020