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 A020743 #17 Jun 10 2022 09:26:51
%S A020743 7,10,15,23,36,57,91,146,235,379,612,989,1599,2586,4183,6767,10948,
%T A020743 17713,28659,46370,75027,121395,196420,317813,514231,832042,1346271,
%U A020743 2178311,3524580,5702889,9227467,14930354,24157819,39088171,63245988,102334157,165580143
%N A020743 Pisot sequence L(7,10).
%H A020743 Colin Barker, <a href="/A020743/b020743.txt">Table of n, a(n) for n = 0..1000</a>
%H A020743 <a href="/index/Ph#Pisot">Index entries for Pisot sequences</a>
%H A020743 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1).
%F A020743 a(n) = Fib(n+5)+2 = A157725(n+5). a(n) = 2a(n-1) - a(n-3).
%t A020743 LinearRecurrence[{2,0,-1},{7,10,15},40] (* _Harvey P. Dale_, Jun 10 2022 *)
%o A020743 (PARI) pisotL(nmax, a1, a2) = {
%o A020743 a=vector(nmax); a[1]=a1; a[2]=a2;
%o A020743 for(n=3, nmax, a[n] = ceil(a[n-1]^2/a[n-2]));
%o A020743 a
%o A020743 }
%o A020743 pisotL(50, 7, 10) \\ _Colin Barker_, Aug 07 2016
%Y A020743 Subsequence of A018910. See A008776 for definitions of Pisot sequences.
%Y A020743 Cf. A020717.
%K A020743 nonn,easy
%O A020743 0,1
%A A020743 _David W. Wilson_