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 A176965 #61 Sep 08 2022 08:45:53
%S A176965 1,0,6,2,26,10,106,42,426,170,1706,682,6826,2730,27306,10922,109226,
%T A176965 43690,436906,174762,1747626,699050,6990506,2796202,27962026,11184810,
%U A176965 111848106,44739242,447392426,178956970,1789569706,715827882,7158278826
%N A176965 a(n) = 2^(n-1) - (2^n*(-1)^n + 2)/3.
%C A176965 The ratio a(n+1)/a(n) approaches 10 for even n and 2/5 for odd n as n->infinity.
%H A176965 G. C. Greubel, <a href="/A176965/b176965.txt">Table of n, a(n) for n = 1..1000</a>
%H A176965 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,4,-4).
%F A176965 From _R. J. Mathar_, Apr 30 2010: (Start)
%F A176965 a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3).
%F A176965 G.f.: x*(1 - x + 2*x^2)/( (1-x)*(1+2*x)*(1-2*x) ). (End)
%F A176965 a(n) = A087231(n), n > 2. - _R. J. Mathar_, May 03 2010
%F A176965 a(2n-1) = A061547(2n), a(2n) = A061547(2n-1), n > 0. - _Yosu Yurramendi_, Dec 23 2016
%F A176965 a(n+1) = 2*A096773(n), n > 0. - _Yosu Yurramendi_, Dec 30 2016
%F A176965 a(2n-1) = A020989(n-1), a(2n) = A020988(n-1), n > 0. - _Yosu Yurramendi_, Jan 03 2017
%F A176965 a(2n-1) = (A083597(n-1) + A000302(n-1))/2, a(2n) = (A083597(n-1) - A000302(n-1))/2, n > 0. - _Yosu Yurramendi_, Mar 04 2017
%F A176965 a(n+2) = 4*a(n) + 2, a(1) = 1, a(2) = 0, n > 0. - _Yosu Yurramendi_, Mar 07 2017
%F A176965 a(n) = (-16 + (9 - (-1)^n) * 2^(n - (-1)^n))/24. - _Loren M. Pearson_, Dec 28 2019
%F A176965 E.g.f.: (3*exp(2*x) - 4*exp(x) + 3 - 2*exp(-2*x))/6. - _G. C. Greubel_, Dec 28 2019
%F A176965 a(n) = (2^n*5^(n mod 2) - 4)/6. - _Heinz Ebert_, Jun 29 2021
%p A176965 seq( (3*2^(n-1) -(-2)^n -2)/3, n=1..30); # _G. C. Greubel_, Dec 28 2019
%t A176965 a[n_]:= a[n]= 2^(n-1)*If[n==1, 1, a[n-1]/2 +(-1)^(n-1)*Sqrt[(5 +4*(-1)^(n-1) )]/2]; Table[a[n], {n,30}]
%t A176965 LinearRecurrence[{1,4,-4}, {1,0,6}, 30] (* _G. C. Greubel_, Dec 28 2019 *)
%o A176965 (PARI) vector(30, n, (3*2^(n-1) -(-2)^n -2)/3 ) \\ _G. C. Greubel_, Dec 28 2019
%o A176965 (Magma) [(3*2^(n-1) -(-2)^n -2)/3: n in [1..30]]; // _G. C. Greubel_, Dec 28 2019
%o A176965 (Sage) [(3*2^(n-1) -(-2)^n -2)/3 for n in (1..30)] # _G. C. Greubel_, Dec 28 2019
%o A176965 (GAP) List([1..30], n-> (3*2^(n-1) -(-2)^n -2)/3); # _G. C. Greubel_, Dec 28 2019
%Y A176965 Merger of A020988 (even n) and A020989 (odd n).
%K A176965 nonn,easy
%O A176965 1,3
%A A176965 _Roger L. Bagula_, Apr 29 2010