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 A190974 #27 Jun 11 2022 03:33:53
%S A190974 0,1,7,44,273,1691,10472,64849,401583,2486836,15399937,95365379,
%T A190974 590557968,3657078881,22646762327,140241941884,868459781553,
%U A190974 5378008761451,33303762422392,206236293149489,1277135239934463,7908765213793796,48975680296884257
%N A190974 a(n) = 7*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
%H A190974 G. C. Greubel, <a href="/A190974/b190974.txt">Table of n, a(n) for n = 0..1000</a>
%H A190974 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (7,-5).
%F A190974 a(n) = ((7/2 + 1/2*sqrt(29))^n - (7/2 - 1/2*sqrt(29))^n)/sqrt(29). - _Giorgio Balzarotti_, May 28 2011
%F A190974 G.f.: x/(1 - 7*x + 5*x^2). - _Philippe Deléham_, Oct 12 2011
%F A190974 From _G. C. Greubel_, Jun 11 2022: (Start)
%F A190974 a(n) = 5^((n-1)/2)*ChebyshevU(n-1, 7/(2*sqrt(5))).
%F A190974 E.g.f.: (2/sqrt(29))*exp(7*x/2)*sinh(sqrt(29)*x/2). (End)
%t A190974 LinearRecurrence[{7,-5}, {0,1}, 50]
%o A190974 (Magma) [n le 2 select n-1 else 7*Self(n-1) - 5*Self(n-2): n in [1..51]]; // _G. C. Greubel_, Jun 11 2022
%o A190974 (SageMath) [lucas_number1(n,7,5) for n in (0..50)] # _G. C. Greubel_, Jun 11 2022
%Y A190974 Cf. A190958 (index to generalized Fibonacci sequences).
%K A190974 nonn,easy
%O A190974 0,3
%A A190974 _Vladimir Joseph Stephan Orlovsky_, May 24 2011