%I #23 Oct 31 2023 15:43:27
%S 1,3,9,27,77,207,529,1299,3093,7191,16409,36891,81949,180255,393249,
%T 852003,1835045,3932199,8388649,17825835,37748781,79691823,167772209,
%U 352321587,738197557,1543503927,3221225529,6710886459,13958643773,28991029311,60129542209
%N a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048472.
%H Colin Barker, <a href="/A048481/b048481.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (6,-13,12,-4).
%F Row sums of triangle A134397. Also, binomial transform of A048166. - _Gary W. Adamson_, Oct 23 2007
%F a(n) = 6*a(n-1)-13*a(n-2)+12*a(n-3)-4*a(n-4). - _Colin Barker_, Dec 04 2014
%F G.f.: (4*x^2-3*x+1) / ((x-1)^2*(2*x-1)^2). - _Colin Barker_, Dec 04 2014
%F a(n) = 2^(n+1)*(n-2) + 2*n + 5. - _Christian Krause_, Oct 31 2023
%t LinearRecurrence[{6,-13,12,-4},{1,3,9,27},40] (* _Harvey P. Dale_, Aug 13 2015 *)
%o (PARI) Vec((4*x^2-3*x+1)/((x-1)^2*(2*x-1)^2) + O(x^100)) \\ _Colin Barker_, Dec 04 2014
%Y Partial sums of A048495.
%Y Cf. A134397, A048166.
%K nonn,easy
%O 0,2
%A _Clark Kimberling_
%E Corrected by _T. D. Noe_, Nov 08 2006
|