Peart, Paul; Woan, Wen-Jin Dyck paths with no peaks at height \(k\). (English) Zbl 0969.05002 J. Integer Seq. 4, No. 1, Art. 01.1.3., 6 p. (2001). Summary: A Dyck path of length \(2n\) is a path in two-space from \((0,0)\) to \((2n,0)\) which uses only steps \((1,1)\) (north-east) and \((1,-1)\) (south-east). Further, a Dyck path does not go below the \(x\)-axis. A peak on a Dyck path is a node that is immediately preceded by a north-east step and immediately followed by a south-east step. A peak is at height \(k\) if its \(y\)-coordinate is \(k\). Let \(G_k(x)\) be the generating function for the number of Dyck paths of length \(2n\) with no peaks at height \(k\) with \(k\geq 1\). It is known that \(G_1(x)\) is the generating function for the Fine numbers (sequence A000957 in [N. J. A. Sloane, The on-line encyclopedia of integer sequences (published electronically)]). In this paper, we derive the recurrence \[ G_k(x) = \frac{1}{1-xG_{k-1}(x)}, \quad k \geq 2, \qquad G_1(x) = \frac{2} {1+2x+\sqrt{1-4x}}. \] It is interesting to see that in the case \(k=2\) we get \(G_2(x)=1+xC(x)\), where \(C(x)\) is the generating function for the ubiquitous Catalan numbers (A000108). This means that the number of Dyck paths of length \(2n+2, n \geq 0\), with no peaks at height 2 is the Catalan number \(c_n =\frac{1}{n+1}\binom{2n}{n}\). We also provide a combinatorial proof for this last fact by introducing a bijection between the set of all Dyck paths of length \(2n+2\) with no peaks at height 2 and the set of all Dyck paths of length \(2n\). Cited in 13 Documents MSC: 05A15 Exact enumeration problems, generating functions Keywords:Dyck path; generating function; Fine number; Catalan number Software:OEIS PDFBibTeX XMLCite \textit{P. Peart} and \textit{W.-J. Woan}, J. Integer Seq. 4, No. 1, Art. 01.1.3., 6 p. (2001; Zbl 0969.05002) Full Text: EuDML EMIS Online Encyclopedia of Integer Sequences: Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Fine’s sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n nodes having root of even degree. Number of Dyck paths of semilength n with no peak at height 3. Number of Dyck paths of semilength n with no peak at height 4.