|
%I #7 Jul 31 2015 21:20:38
%S 5,7,9,7,-15,-113,-471,-1673,-5535,-17633,-54951,-168953,-515055,
%T -1561553,-4717431,-14217833,-42784575,-128615873,-386371911,
%U -1160164313,-3482590095,-10451964593,-31364282391,-94109624393,-282362427615,-847154391713,-2541597392871,-7625060614073
%N 2+4*2^n-3^n.
%D G. S. Lueker, Some techniques for solving recurrences, Computing Surveys, 12 (1980), 419-436.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6, -11, 6).
%F a(0)=5, a(1)=7, a(2)=9, a(n)=6*a(n-1)-11*a(n-2)+6*a(n-3). - _Harvey P. Dale_, Sep 23 2012
%t Table[2+4*2^n-3^n,{n,0,30}] (* or *) LinearRecurrence[{6,-11,6},{5,7,9},30] (* _Harvey P. Dale_, Sep 23 2012 *)
%K sign
%O 0,1
%A _N. J. A. Sloane_, Mar 07 2008
|
