OFFSET
0,2
COMMENTS
a(n) is the number of Dyck (n+1)-paths (A000108) containing no DUDD and no UUPDD where P is a nonempty Dyck subpath. Example: a(2)=3 counts UUDDUD, UDUUDD, UDUDUD but omits UUUDDD because it contains an offending UUPDD and omits UUDUDD because it contains a DUDD. - David Callan, Oct 26 2006
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: A(x) = (1-x^2)/(1-x)^2 + x^2*A(x)^2.
a(n) ~ sqrt(11*r-3) / (4*sqrt(2*Pi)*(1-r)*n^(3/2)*r^(n+5/2)), where r = 0.3478103847799310287... is the root of the equation 4*r^3+4*r^2+r = 1. - Vaclav Kotesovec, Mar 22 2014
D-finite with recurrence (n+2)*a(n) +2*(-n-1)*a(n-1) +(-3*n+4)*a(n-2) +4*a(n-3) +4*(n-3)*a(n-4)=0. - R. J. Mathar, Sep 29 2020
MATHEMATICA
CoefficientList[Series[(-1+x+Sqrt[1+x*(-2-3*x+4*x^3)])/(2*(-1+x)*x^2), {x, 0, 20}], x] (* Vaclav Kotesovec, Mar 22 2014 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 24 2003
STATUS
approved