OFFSET
0,2
COMMENTS
a(n) = number of Dyck (n+3)-paths whose initial ascent has length divisible by 3. For example, UUUUDDUDDD has initial ascent of length 4 and a(1) counts UUUDUDDD, UUUDDUDD, UUUDDDUD. - David Callan, Jul 25 2005
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
FORMULA
a(n) ~ 15*4^n/(sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, Mar 21 2014
a(n) = 3*binomial(2*n,n)*(5*n^2+3*n+4)/((n+1)*(n+2)*(n+3)) for n>0. - Tani Akinari, Aug 03 2025
MATHEMATICA
CoefficientList[Series[(1 + x^3 ((1 - (1 - 4 x)^(1/2))/(2 x))^3) ((1 - (1 - 4 x)^(1/2))/(2 x))^3, {x, 0, 20}], x] (* Vaclav Kotesovec, Mar 21 2014 *)
PROG
(Maxima) a(n):=if n=0 then 1 else 3*binomial(2*n, n)*(5*n^2+3*n+4)/((n+1)*(n+2)*(n+3)); /* Tani Akinari, Aug 03 2025 */
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 06 2002
STATUS
approved
