login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A334787 a(n) is the total number of down steps before the first up step in all 4_3-Dyck paths of length 5*n. A 4_3-Dyck path is a lattice path with steps (1, 4), (1, -1) that starts and ends at y = 0 and stays above the line y = -3. 5
0, 6, 34, 251, 2105, 19040, 181076, 1784728, 18067803, 186754590, 1962728460, 20910164730, 225308533359, 2451112021568, 26885549373440, 297008527319440, 3301615350645935, 36903975448964670, 414518195957729886, 4676429192392769805, 52965796433899543810 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
A. Asinowski, B. Hackl, and S. Selkirk, Down step statistics in generalized Dyck paths, arXiv:2007.15562 [math.CO], 2020.
FORMULA
a(0) = 0 and a(n) = 4*binomial(5*n, n)/(n+1) - binomial(5*n+3, n)/(n+1) for n > 0.
a(n) ~ c*2^(-8*n)*5^(5*n)/n^(3/2), where c = (131/128)*sqrt(5/(2*Pi)). - Stefano Spezia, Oct 19 2022
EXAMPLE
For n = 1, there are the 4_3-Dyck paths UDDDD, DUDDD, DDUDD, DDDUD. Before the first up step there are a(1) = 0 + 1 + 2 + 3 = 6 down steps in total.
MATHEMATICA
a[0] = 0; a[n_] := 4 * Binomial[5*n, n]/(n+1) - Binomial[5*n+3, n]/(n+1); Array[a, 21, 0]
CROSSREFS
Sequence in context: A230331 A267242 A197436 * A302148 A218685 A108432
KEYWORD
nonn,easy
AUTHOR
Sarah Selkirk, May 11 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 01:34 EDT 2024. Contains 371887 sequences. (Running on oeis4.)