OFFSET
0,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
FORMULA
a(n) = sum(binomial(2k, k)/(k+1), k=0..2n+1). - Emeric Deutsch, Dec 20 2004
Recurrence: (n+1)*(2*n+1)*a(n) = 3*(2*n^2 + 15*n - 1)*a(n-1) + 6*(74*n^2 - 231*n + 164)*a(n-2) - 28*(4*n-7)*(4*n-5)*a(n-3). - Vaclav Kotesovec, Oct 17 2012
a(n) ~ 2^(4*n+5/2)/(3*sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, Oct 17 2012
MAPLE
a:=n->sum(binomial(2*k, k)/(k+1), k=0..2*n+1): seq(a(n), n=0..20); # Emeric Deutsch, Dec 20 2004
MATHEMATICA
Table[Sum[Binomial[2k, k]/(k+1), {k, 0, 2*n+1}], {n, 0, 20}] (* Vaclav Kotesovec, Oct 17 2012 *)
PROG
(PARI) a(n)=sum(k=0, 2*n+1, binomial(2*k, k)/(k+1)); \\ Joerg Arndt, May 12 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 19 2004
EXTENSIONS
More terms from Emeric Deutsch, Dec 20 2004
STATUS
approved