cp's OEIS Frontend

A135094 a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3.

%I A135094 #18 Sep 08 2022 08:45:32
%S A135094 0,1,3,8,18,40,84,176,360,736,1488,3008,6048,12160,24384,48896,97920,
%T A135094 196096,392448,785408,1571328,3143680,6288384,12578816,25159680,
%U A135094 50323456,100651008,201310208,402628608,805273600,1610563584,3221159936
%N A135094 a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3.
%H A135094 G. C. Greubel, <a href="/A135094/b135094.txt">Table of n, a(n) for n = 0..1000</a>
%H A135094 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,-4).
%F A135094 From _R. J. Mathar_, Feb 15 2008: (Start)
%F A135094 O.g.f.: -3/(2*(2*x-1)) + (4*x+3)/(2*(2*x^2-1)).
%F A135094 a(n) = 3*2^(n-1) - A063759(n+1)/2. (End)
%F A135094 From _Colin Barker_, Sep 23 2016: (Start)
%F A135094 a(n) = 3*2^(n-1) - 3*2^(n/2-1) for n even.
%F A135094 a(n) = 3*2^(n-1) - 2^((n+1)/2) for n odd. (End)
%t A135094 LinearRecurrence[{2, 2, -4}, {0, 1, 3}, 50] (* _G. C. Greubel_, Sep 22 2016 *)
%o A135094 (Magma) I:=[0,1,3]; [n le 3 select I[n] else 2*Self(n-1)+2*Self(n-2)-4*Self(n-3): n in [1..40]]; // _Vincenzo Librandi_, Sep 23 2016
%Y A135094 Cf. A026635, A026657.
%K A135094 nonn,easy
%O A135094 0,3
%A A135094 _Paul Curtz_, Feb 12 2008
%E A135094 More terms from _R. J. Mathar_, Feb 15 2008