|
%I #27 Dec 23 2023 16:43:09
%S 0,1,3,1,-21,-71,-45,433,1659,1513,-8733,-38303,-45045,171289,874227,
%T 1252369,-3236709,-19729079,-33293565,57951937,440204331,856997497,
%U -950642157,-9707906447,-21518582085,13107505321,211471172643,529553475361,-103108955061
%N a(n) = 3*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.
%H G. C. Greubel, <a href="/A190962/b190962.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-8).
%F G.f.: x/(1-3*x+8*x^2). - _Philippe Deléham_, Oct 11 2011
%t LinearRecurrence[{3,-8}, {0,1}, 50]
%o (PARI) x='x+O('x^30); concat([0], Vec(x/(1-3*x+8*x^2))) \\ _G. C. Greubel_, Jan 25 2018
%o (Magma) I:=[0,1]; [n le 2 select I[n] else 3*Self(n-1) - 8*Self(n-2): n in [1..30]]; // _G. C. Greubel_, Jan 25 2018
%Y Cf. A190958 (index to generalized Fibonacci sequences).
%K sign,easy
%O 0,3
%A _Vladimir Joseph Stephan Orlovsky_, May 24 2011
|
