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 A190986 #28 Dec 23 2023 09:45:15
%S A190986 0,1,10,96,920,8816,84480,809536,7757440,74336256,712332800,
%T A190986 6825982976,65410498560,626801053696,6006368542720,57556481212416,
%U A190986 551539337953280,5285167454683136,50645517195018240,485314502131449856,4650562952534425600,44564371516818456576
%N A190986 a(n) = 10*a(n-1) - 4*a(n-2), with a(0)=0, a(1)=1.
%H A190986 G. C. Greubel, <a href="/A190986/b190986.txt">Table of n, a(n) for n = 0..1000</a>
%H A190986 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,-4).
%H A190986 <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a>
%F A190986 G.f.: x/(1 - 10*x + 4*x^2). - _Philippe Deléham_, Oct 12 2011
%F A190986 E.g.f.: (1/sqrt(21))*exp(5*x)*sinh(sqrt(21)*x). - _G. C. Greubel_, Sep 03 2022
%F A190986 a(n) = 2^(n-1)*S(n-1, 5), with the Chebyshev S-polynomial (see A049310) S(n-1, 5) = A004254(n). See the Magma program by _G. C. Greubel_. - _Wolfdieter Lang_, Nov 15 2023
%t A190986 LinearRecurrence[{10,-4}, {0,1}, 50]
%o A190986 (Magma) [2^(n-1)*Evaluate(ChebyshevU(n-1), 5/2): n in [0..30]]; // _G. C. Greubel_, Sep 03 2022
%o A190986 (SageMath)
%o A190986 A190986 = BinaryRecurrenceSequence(10, -4, 0, 1)
%o A190986 [A190986(n) for n in (0..30)] # _G. C. Greubel_, Sep 03 2022
%Y A190986 Cf. A190958 (index to generalized Fibonacci sequences).
%Y A190986 Cf. A004254, A049310.
%K A190986 nonn,easy
%O A190986 0,3
%A A190986 _Vladimir Joseph Stephan Orlovsky_, May 24 2011