|
%I #41 Sep 08 2022 08:46:01
%S 0,4,8,32,96,320,1024,3328,10752,34816,112640,364544,1179648,3817472,
%T 12353536,39976960,129368064,418643968,1354760192,4384096256,
%U 14187233280,45910851584,148570636288,480784678912,1555851902976,5034842521600,16293092655104
%N a(n) = 2*a(n-1) + 4*a(n-2) with n>1, a(0)=0, a(1)=4.
%C a(n)/A063727(n) are convergents for A134972.
%C Abs(Sum_{i=0..n} C(n,n-i)*a(i)-(sqrt(5)-1)* A033887(n))->0. - _Seiichi Kirikami_, Jan 20 2016
%D E. W. Cheney, Introduction to Approximation Theory, McGraw-Hill, Inc., 1966.
%H Bruno Berselli, <a href="/A209084/b209084.txt">Table of n, a(n) for n = 0..500</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,4).
%F a(n) = (2/sqrt(5))*((1+sqrt(5))^n-(1-sqrt(5))^n).
%F G.f.: 4*x/(1-2*x-4*x^2). - _Bruno Berselli_, Mar 08 2012
%F a(n) = 4*A085449(n) = 2*A103435(n). - _Bruno Berselli_, Mar 08 2012
%F Sum_{n>=1} 1/a(n) = (1/4) * A269991. - _Amiram Eldar_, Feb 01 2021
%t RecurrenceTable[{a[n]==2*a[n-1]+4*a[n-2], a[0]==0, a[1]==4], a, {n, 30}]
%t LinearRecurrence[{2, 4}, {0, 4}, 40] (* _Vincenzo Librandi_, Jan 16 2016 *)
%o (PARI) concat(0, Vec(4*x/(1-2*x-4*x^2) + O(x^40))) \\ _Michel Marcus_, Jan 16 2016
%o (Magma) I:=[0,4]; [n le 2 select I[n] else 2*Self(n-1)+4*Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Jan 16 2016
%Y Cf. A063727, A033887, A085449, A103435, A134972, A269991.
%Y Cf. A086344 (this sequence with signs).
%K nonn,easy
%O 0,2
%A _Seiichi Kirikami_, Mar 06 2012
|
