\relax 
\ifx\hyper@anchor\@undefined
\global \let \oldcontentsline\contentsline
\gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global \let \oldnewlabel\newlabel
\gdef \newlabel#1#2{\newlabelxx{#1}#2}
\gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\let \contentsline\oldcontentsline
\let \newlabel\oldnewlabel}
\else
\global \let \hyper@last\relax 
\fi

\citation{Sloane}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\citation{Sloane}
\citation{D2}
\citation{MSV13}
\citation{MSV13}
\citation{Sun}
\newlabel{eqcatalan}{{1}{2}{Introduction\relax }{equation.1}{}}
\newlabel{eqmotzkin}{{2}{2}{Introduction\relax }{equation.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Enumeration of Dyck paths according to number of $uu\cdots  udu$'s or number of $udud\cdots  udu$'s}{2}{section.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Enumeration of Dyck paths according to number of $uu\cdots  udu$'s}{2}{subsection.2.1}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Number of Dyck paths of length $2n$ according to the statistics $\alpha _1$ and $\alpha _2$.}}{3}{table.1}}
\newlabel{tab1}{{1}{3}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{table.1}{}}
\newlabel{th11}{{2.1}{3}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{proposition.2.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces First return decomposition of a Dyck path with nonempty Dyck paths.}}{3}{figure.1}}
\newlabel{fig1}{{1}{3}{Proof\relax }{figure.1}{}}
\newlabel{th13}{{2.1}{3}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{theorem.2.1}{}}
\citation{Sloane}
\citation{wilf}
\citation{Sloane}
\newlabel{exaaa}{{2.4}{4}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{theorem.2.4}{}}
\newlabel{lem11}{{2.1}{5}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{lemma.2.1}{}}
\citation{Sun}
\citation{Sloane}
\newlabel{th12}{{2.5}{6}{Enumeration of Dyck paths according to number of $uu\cdots udu$'s\relax }{theorem.2.5}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Enumeration of Dyck paths according to number of $ud\cdots  udu$'s}{7}{subsection.2.2}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Number of Dyck paths of length $2n$ according the statistic $\beta _2$.}}{7}{table.2}}
\newlabel{tab2}{{2}{7}{Enumeration of Dyck paths according to number of $ud\cdots udu$'s\relax }{table.2}{}}
\newlabel{th21}{{2.2}{7}{Enumeration of Dyck paths according to number of $ud\cdots udu$'s\relax }{proposition.2.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces First return decomposition of a Dyck path according the statistic $ududu$.}}{8}{figure.2}}
\newlabel{fig2}{{2}{8}{Proof\relax }{figure.2}{}}
\newlabel{th22}{{2.6}{8}{Enumeration of Dyck paths according to number of $ud\cdots udu$'s\relax }{theorem.2.6}{}}
\newlabel{sbb}{{3}{8}{Enumeration of Dyck paths according to number of $ud\cdots udu$'s\relax }{equation.3}{}}
\citation{Sun}
\citation{Sun}
\newlabel{th23}{{2.2}{9}{Enumeration of Dyck paths according to number of $ud\cdots udu$'s\relax }{corollary.2.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Enumeration of Dyck paths according to number of $uu\ldots  udu$'s or number of $udud\ldots  udu$'s at low and high levels}{9}{section.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Enumeration of Dyck paths according to number of $uu\ldots  udu$'s at low and high levels}{9}{subsection.3.1}}
\citation{wilf}
\citation{Sun}
\newlabel{th31}{{3.1}{10}{Enumeration of Dyck paths according to number of $uu\ldots udu$'s at low and high levels\relax }{theorem.3.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces First return decomposition of a Dyck path.}}{10}{figure.3}}
\newlabel{fig3}{{3}{10}{Proof\relax }{figure.3}{}}
\citation{Sun}
\newlabel{th32}{{3.2}{11}{Enumeration of Dyck paths according to number of $uu\ldots udu$'s at low and high levels\relax }{theorem.3.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Enumeration of Dyck paths according to number of $ud\ldots  udu$'s at low and high levels}{11}{subsection.3.2}}
\citation{Sun}
\citation{Sun}
\bibcite{D2}{1}
\bibcite{K9}{2}
\bibcite{KM10}{3}
\bibcite{KP11}{4}
\bibcite{M}{5}
\bibcite{MRSV12}{6}
\bibcite{MSV13}{7}
\newlabel{th41}{{3.3}{12}{Enumeration of Dyck paths according to number of $ud\ldots udu$'s at low and high levels\relax }{theorem.3.3}{}}
\newlabel{th42}{{3.4}{12}{Enumeration of Dyck paths according to number of $ud\ldots udu$'s at low and high levels\relax }{theorem.3.4}{}}
\bibcite{Sloane}{8}
\bibcite{Sun}{9}
\bibcite{wilf}{10}