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 A262714 #24 Sep 08 2022 08:46:14
%S A262714 2,2,5,11,56,617,34553,21319202,736642386707,15704627843968647815,
%T A262714 11568694537326272321321120595206,
%U A262714 181682042349262169758803442669575561298555791374891,2101824050856189730969091901210449068013789839106586804501928241686514359003372547
%N A262714 a(n) = a(n-1)*a(n-2) + 1, with a(0) = a(1) = 2.
%H A262714 G. C. Greubel, <a href="/A262714/b262714.txt">Table of n, a(n) for n = 0..17</a>
%t A262714 RecurrenceTable[{a[0]==a[1]==2, a[n]==a[n-1]*a[n-2] +1}, a, {n, 0, 20}]
%o A262714 (Magma) [n le 2 select 2 else Self(n-1)*Self(n-2)+1: n in [1..20]];
%o A262714 (PARI) a(n) = if(n<2, 2, 1 + a(n-1)*a(n-2))
%o A262714 vector(20, n, a(n-1)) \\ _Altug Alkan_, Sep 30 2015
%o A262714 (PARI) {a(n) = if( n<2, 2 * (n>=0), self()(n-1) * self()(n-2) + 1)}; /* _Michael Somos_, Oct 02 2015 */
%o A262714 (Sage)
%o A262714 def a(n):
%o A262714 if (n==0 or n==1): return 2
%o A262714 else: return a(n-1)*a(n-2) +1
%o A262714 [a(n) for n in (0..20)] # _G. C. Greubel_, Jun 07 2019
%Y A262714 Cf. A007660, A055937.
%K A262714 nonn,easy
%O A262714 0,1
%A A262714 _Vincenzo Librandi_, Sep 30 2015