OFFSET
1,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..200
D. Merlini, Generating functions for the area below some lattice paths, Discrete Mathematics and Theoretical Computer Science AC, 2003, 217-228.
FORMULA
Recurrence: n*(3*n-4)*a(n) = 2*(12*n^2-13*n-2)*a(n-1) - 8*(2*n-1)*(3*n-1) * a(n-2). - Vaclav Kotesovec, Oct 17 2012
a(n) ~ 3*2^(2*n-2)*n*(1-8/(3*sqrt(Pi)*sqrt(n))). - Vaclav Kotesovec, Oct 17 2012
a(n) = 2^(2*n-2)*(3*n+4)-(n+1)*C(2*n+1,n). - Vaclav Kotesovec, Oct 28 2012
MATHEMATICA
Rest[CoefficientList[Series[(1-x-Sqrt[1-4*x])/(1-4*x)^2, {x, 0, 20}], x]] (* Vaclav Kotesovec, Oct 17 2012 *)
Table[2^(2*n-2)*(3*n+4)-(n+1)*Binomial[2*n+1, n], {n, 1, 20}] (* Vaclav Kotesovec, Oct 28 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Ralf Stephan, Mar 17 2005
STATUS
approved