The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A334786 a(n) is the total number of down steps before the first up step in all 4_2-Dyck paths of length 5*n. A 4_2-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 = -2. 4

%I

%S 0,3,16,115,950,8510,80388,788392,7950930,81935425,859005840,

%T 9132977490,98240702586,1067197649840,11691092372000,129011823098160,

%U 1432744619523530,16000911127589355,179590878292003200,2024687100104286525,22917687021180660940

%N a(n) is the total number of down steps before the first up step in all 4_2-Dyck paths of length 5*n. A 4_2-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 = -2.

%H A. Asinowski, B. Hackl, and S. Selkirk, <a href="https://arxiv.org/abs/2007.15562">Down step statistics in generalized Dyck paths</a>, arXiv:2007.15562 [math.CO], 2020.

%F a(0) = 0 and a(n) = 4 * binomial(5*n, n)/(n+1) - 2 * binomial(5*n+2, n)/(n+1) for n > 0.

%e For n = 1, there are the 4_2-Dyck paths UDDDD, DUDDD, DDUDD. Before the first up step there are a(1) = 0 + 1 + 2 = 3 down steps in total.

%t a = 0; a[n_] := 4 * Binomial[5*n, n]/(n+1) - 2 * Binomial[5*n+2, n]/(n+1); Array[a, 21, 0]

%Y Cf. A001764, A002293, A002294, A334785, A334787.

%K nonn,easy

%O 0,2

%A _Sarah Selkirk_, May 11 2020

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

Last modified January 20 04:53 EST 2021. Contains 340301 sequences. (Running on oeis4.)