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!)
A018217 Sum(C(j)*(n-j)*4^(n-j),j=0..n-1), C = Catalan numbers. 1
0, 4, 36, 232, 1300, 6744, 33320, 159184, 742068, 3395320, 15308920, 68213424, 300999816, 1317415792, 5726300880, 24742452128, 106357582324, 455122855224, 1939780103768, 8238185701360, 34876073003352, 147223869286736, 619871651308336, 2603757232133472, 10913483674589000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
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, Oct 07 2012
G.f.: 2/(1-4*x)^2 - 2/(1-4*x)^(3/2). - Mark van Hoeij, Mar 28 2013
MATHEMATICA
Table[2*(n+1)*(4^n-Binomial[2*n+1, n]), {n, 0, 20}] (* Vaclav Kotesovec, Oct 07 2012 *)
Table[Sum[CatalanNumber[j](n-j)4^(n-j), {j, 0, n-1}], {n, 0, 30}] (* Harvey P. Dale, Jul 17 2023 *)
PROG
(PARI) x='x+O('x^66); concat([0], Vec( 2/(1-4*x)^2 - 2/(1-4*x)^(3/2) ) ) \\ Joerg Arndt, May 04 2013
CROSSREFS
Sequence in context: A257888 A197424 A306094 * A003488 A295411 A218516
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Peter Winkler (pw(AT)bell-labs.com)
STATUS
approved

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 24 14:18 EDT 2024. Contains 371960 sequences. (Running on oeis4.)