login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.
2

%I #16 Jan 20 2016 19:05:43

%S 0,1,2,52,200,2896,15392,169792,1078400,10306816,72376832,639480832,

%T 4753049600,40201179136,308548739072,2546754076672,19903847628800,

%U 162051890937856,1279488468058112,10337467701133312,82090381869056000

%N a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.

%C Essentially the same as A053455: a(n) = A053455(n-1), n>=1.

%H Vincenzo Librandi, <a href="/A080921/b080921.txt">Table of n, a(n) for n = 0..200</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,48).

%F a(n) = (8^n - (-6)^n)/14.

%F a(n) = Sum{k=1..n, binomial(n, 2k-1) * 7^(2(k-1)) }

%F G.f.: x/((1+6*x)*(1-8*x)).

%F a(n) = A053455(n-1), n>=1. [_R. J. Mathar_, Sep 18 2008]

%t CoefficientList[Series[x / ((1 + 6 x) (1 - 8 x)), {x, 0, 20}], x] (* _Vincenzo Librandi_, Aug 05 2013 *)

%t LinearRecurrence[{2,48},{0,1},30] (* _Harvey P. Dale_, Jan 20 2016 *)

%Y Cf. A079773, A051958, A015441, A080920.

%K easy,nonn

%O 0,3

%A _Paul Barry_, Feb 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 18:10 EDT 2024. Contains 376182 sequences. (Running on oeis4.)