|
%I #30 Feb 18 2024 03:35:03
%S 4,4,32,144,704,3392,16384,79104,381952,1844224,8904704,42995712,
%T 207601664,1002389504,4839964672,23369416704,112837525504,
%U 544827768832,2630661177344,12701955784704,61330467848192,296129694531584,1429840649519104,6903881376202752
%N a(1)=4, a(2)=4, a(n) = 4*a(n-1) + 4*a(n-2)
%H Vincenzo Librandi, <a href="/A189743/b189743.txt">Table of n, a(n) for n = 1..100</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,4).
%F G.f.: 4*x*(1-3*x)/(1-4*x-4*x^2). - Bruno Berselli, May 24 2011
%t LinearRecurrence[{4,4},{4,4},40]
%o (Maxima) a[1]:4$ a[2]:4$ a[n]:=4*a[n-1]+4*a[n-2]$ makelist(a[n], n, 1, 24); /* _Bruno Berselli_, May 24 2011 */
%Y Cf. A000045, A000079, A105476, A159612, A080040, A135522, A103435, A189732, A189734, A189735, A189736, A189737, A189738, A189739, A189741, A189742, A189744, A189745, A189746, A189747, A189748, A189749.
%K nonn,easy
%O 1,1
%A _Harvey P. Dale_, Apr 26 2011
|
