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 A084132 #25 Oct 13 2022 16:50:48
%S A084132 1,2,14,68,356,1832,9464,48848,252176,1301792,6720224,34691648,
%T A084132 179087936,924501632,4772534144,24637146368,127183790336,656558039552,
%U A084132 3389334900224,17496687838208,90322760754176,466271170045952
%N A084132 a(n) = 4*a(n-1) + 6*a(n-2), a(0)=1, a(1)=2.
%C A084132 Binomial transform of A002535.
%H A084132 G. C. Greubel, <a href="/A084132/b084132.txt">Table of n, a(n) for n = 0..1000</a>
%H A084132 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,6).
%F A084132 a(n) = (2+sqrt(10))^n/2 + (2-sqrt(10))^n/2.
%F A084132 G.f.: (1-2*x)/(1-4*x-6*x^2).
%F A084132 E.g.f.: exp(2*x)*cosh(sqrt(10)*x).
%F A084132 a(n) = Sum_{k=0..n} A201730(n,k)*9^k. - _Philippe Deléham_, Dec 06 2011
%F A084132 G.f.: G(0)/2, where G(k) = 1 + 1/(1 - x*(5*k-2)/(x*(5*k+3) - 1/G(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, Jun 03 2013
%F A084132 a(n) = 2*i^n*6^((n-2)/2)*( 3*ChebyshevU(n, 2/(i*sqrt(6))) + i*sqrt(6)*ChebyshevU(n -1, 2/(i*sqrt(6))) ). - _G. C. Greubel_, Oct 13 2022
%t A084132 LinearRecurrence[{4,6}, {1,2}, 40] (* _G. C. Greubel_, Oct 13 2022 *)
%o A084132 (SageMath) [lucas_number2(n,4,-6)/2 for n in range(0, 22)] # _Zerinvary Lajos_, May 14 2009
%o A084132 (SageMath)
%o A084132 A084132=BinaryRecurrenceSequence(4,6,1,2)
%o A084132 [A084132(n) for n in range(41)] # _G. C. Greubel_, Oct 13 2022
%o A084132 (Magma) [n le 2 select 2^(n-1) else 4*Self(n-1) +6*Self(n-2): n in [1..40]]; // _G. C. Greubel_, Oct 13 2022
%Y A084132 Cf. A002535, A005667, A201730.
%K A084132 easy,nonn
%O A084132 0,2
%A A084132 _Paul Barry_, May 16 2003