|
%I #35 Sep 08 2022 08:46:04
%S 0,1,4,12,30,70,160,364,824,1848,4096,8976,19488,42016,90112,192448,
%T 409472,868224,1835008,3866880,8126976,17039872,35651584,74447872,
%U 155187200,322959360,671088640,1392513024,2885689344,5972697088,12348030976
%N Binomial transform of A212831(n).
%C Companion to A217988.
%C Considering a(n+1) - 2*a(n) = 1,2,4,6,10,20,44,96,200,... = b(n), is
%C b(n+3) - 2*b(n+2) = -2,-2,0,4,8,8,0,-16,-32,-32,0,... = -A009545(n+2).
%H Vincenzo Librandi, <a href="/A218009/b218009.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,-14,16,-8).
%F G.f.: x*(1-2*x+2*x^2-2*x^3+2*x^4)/((1-2*x)^2*(1-2*x+2*x^2)). - _Bruno Berselli_, Oct 18 2012
%F a(n) = 2^(n-3)*(3*n+2)+(1+i)^(n-4)+(1-i)^(n-4), where i=sqrt(-1) and n>1, with a(0)=0, a(1)=1. - _Bruno Berselli_, Oct 18 2012
%F a(n) = 6*a(n-1) -14*a(n-2) +16*a(n-3) -8*a(n-4).
%t a[n_] := Sum[(1/4)*Binomial[n, k]*((-(1 + (-1)^k))*(-1 + (-1)^Floor[k/2]) - (-3 + (-1)^k)*k), {k, 0, n}]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Oct 18 2012 *)
%t CoefficientList[Series[x*(1 - 2*x + 2*x^2 - 2*x^3 + 2*x^4)/((1 - 2*x)^2*(1 - 2*x + 2*x^2)), {x, 0, 40}], x]; // _Vincenzo Librandi_, Dec 15 2012
%o (Magma) I:=[0, 1, 4, 12, 30, 70]; [n le 6 select I[n] else 6*Self(n-1) - 14*Self(n-2) + 16*Self(n-3) - 8*Self(n-4): n in [1..40]]; // _Vincenzo Librandi_, Dec 15 2012
%Y Cf. A214282, A214283.
%K nonn,easy
%O 0,3
%A _Paul Curtz_, Oct 18 2012
|
