OFFSET
0,3
COMMENTS
Apparently the number of grand Motzkin paths of length n that avoid FF (double flat steps). - David Scambler, Jul 04 2013
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: (1+x)/sqrt((1-2x-2x^2)(1+2x+2x^2)).
D-finite with recurrence: n*a(n) +(n-2)*a(n-1) +4*(-n+1)*a(n-2) +12*(-n+2)*a(n-3) +12*(-n+3)*a(n-4) +4*(-n+4)*a(n-5)=0. - R. J. Mathar, Nov 16 2012
D-finite with recurrence (of order 4): (n-1)*n*a(n) = 4*(n-1)^2*a(n-2) + 4*(n-2)*(2*n-1)*a(n-3) + 4*(n-3)*n*a(n-4). - Vaclav Kotesovec, Feb 08 2014
a(n) ~ sqrt(54+30*sqrt(3)) * (1+sqrt(3))^n / (12 * sqrt(Pi*n)). - Vaclav Kotesovec, Feb 08 2014
MATHEMATICA
CoefficientList[Series[(1+x)/Sqrt[1-4*x^2-8*x^3-4*x^4], {x, 0, 20}], x] (* Vaclav Kotesovec, Feb 08 2014 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Jan 15 2005
STATUS
approved