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!)
A334610 a(n) is the total number of down-steps after the final up-step in all 4_1-Dyck paths of length 5*n (n up-steps and 4*n down-steps). 2
0, 7, 58, 505, 4650, 44677, 443238, 4507461, 46744100, 492492330, 5257084420, 56734340091, 618001356458, 6785943435960, 75033214770640, 834733624099485, 9336542892778440, 104932793226255165, 1184421713336050590, 13421053387405062290, 152613573227667516580 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

A 4_1-Dyck path is a lattice path with steps U = (1, 4), d = (1, -1) that starts at (0,0), stays (weakly) above y = -1, and ends at the x-axis.

LINKS

Table of n, a(n) for n=0..20.

A. Asinowski, B. Hackl, and S. Selkirk, Down step statistics in generalized Dyck paths, arXiv:2007.15562 [math.CO], 2020.

FORMULA

a(n) = 2*binomial(5*(n+1)+2, n+1)/(5*(n+1)+2) - 4*binomial(5*n+2, n)/(5*n+2).

EXAMPLE

For n=1, a(1) = 7 is the total number of down-steps after the last up-step in Udddd, dUddd.

MATHEMATICA

a[n_] := 2 * Binomial[5*n + 7, n + 1]/(5*n + 7) - 4 * Binomial[5*n + 2, n]/(5*n + 2); Array[a, 21, 0] (* Amiram Eldar, May 13 2020 *)

CROSSREFS

Cf. A002294, A334651, A334719, A334611, A334612.

Sequence in context: A051816 A015566 A238810 * A244469 A006193 A139397

Adjacent sequences:  A334607 A334608 A334609 * A334611 A334612 A334613

KEYWORD

nonn

AUTHOR

Andrei Asinowski, May 13 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 July 4 19:50 EDT 2022. Contains 355084 sequences. (Running on oeis4.)