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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018218 Sum(C(j)*(n-j)*4^(n-j-1),j=0..n-1), C = Catalan numbers. 6

%I #24 Sep 08 2022 08:44:44

%S 0,1,9,58,325,1686,8330,39796,185517,848830,3827230,17053356,75249954,

%T 329353948,1431575220,6185613032,26589395581,113780713806,

%U 484945025942,2059546425340,8719018250838,36805967321684

%N Sum(C(j)*(n-j)*4^(n-j-1),j=0..n-1), C = Catalan numbers.

%H Vincenzo Librandi, <a href="/A018218/b018218.txt">Table of n, a(n) for n = 0..173</a>

%F a(n)=(n+1)*(4^n-binomial(2*n+1, n))/2; G.f.: x*c(x)/(1-4*x)^2, where c(x) = g.f. for Catalan numbers A000108; also convolution of A000346(n-1), n >= 0, where A000346(-1)=0, with A000302 (powers of 4). - _Wolfdieter Lang_

%F Asymptotics: a(n) ~ 2^(2*n-1)*(n+1-sqrt(4*n/Pi)). - _Fung Lam_, Mar 28 2014

%F Recurrence: (n-1)*n*a(n) = 2*(n-1)*(4*n+1)*a(n-1) - 8*n*(2*n-1)*a(n-2). - _Vaclav Kotesovec_, Mar 28 2014

%t Table[Sum[CatalanNumber[j](n-j)4^(n-j-1),{j,-0,n-1}],{n,0,30}] (* _Harvey P. Dale_, Nov 15 2020 *)

%o (Magma) [(n+1)*(4^n-Binomial(2*n+1, n))/2: n in [0..25]]; // _Vincenzo Librandi_, Jun 09 2011

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Peter Winkler (pw(AT)bell-labs.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)