|
|
|
|
0, 1, 10, 69, 406, 2186, 11124, 54445, 259006, 1205790, 5519020, 24918306, 111250140, 492051124, 2159081192, 9409526397, 40766269774, 175707380630, 753876367356, 3221460111958, 13716223138388, 58210889582796
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (n+3)*4^n -(n+2)*binomial(2*n+3, n+1)/2.
G.f.: x*(c(x)/(1-4*x))^2, where c(x) = g.f. for Catalan numbers A000108.
a(n+1), n >= 0 is convolution of A000346 with itself; a(n+1), n >= 0 is convolution of Catalan numbers A000108 C(n+1), n >= 0 with A002697; a(-1)=0.
Asymptotics: a(n) ~ 4^n*(n+1-4*sqrt(n/Pi)). - Fung Lam, Mar 28 2014
Recurrence: (n-1)*(n+1)*a(n) = 2*(n+1)*(4*n-3)*a(n-1) - 8*n*(2*n+1)*a(n-2). - Vaclav Kotesovec, Mar 28 2014
|
|
MATHEMATICA
|
CoefficientList[Series[x ((1 - Sqrt[1 - 4 x])/(2 x)/(1 - 4 x))^2, {x, 0, 40}], x] (* Vincenzo Librandi, Mar 29 2014 *)
|
|
PROG
|
(Magma) [(n+3)*4^n -(n+2)*Binomial(2*n+3, n+1)/2: n in [0..25]]; // Vincenzo Librandi, Jun 09 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|