\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\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{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\HyPL@Entry{0<</S/D>>}
\citation{kitaev}
\citation{paisI}
\citation{Mansour}
\citation{paisI}
\citation{Mansour}
\citation{paisI}
\citation{Mansour}
\citation{Sloane}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{2}{section.1}}
\citation{paisI}
\citation{Mansour}
\citation{PAISII}
\citation{BouvelGuerriniEtAl}
\citation{Lin}
\citation{Yan}
\citation{KimLin}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Encodings of permutations}{4}{subsection.1.1}}
\citation{paisI}
\citation{paisI}
\citation{Mansour}
\citation{KimLin}
\citation{Lin}
\citation{Yan}
\citation{paisI}
\citation{BS}
\citation{paisI}
\citation{Mansour}
\citation{paisI}
\citation{Mansour}
\citation{KimLin}
\citation{BouvelGuerriniEtAl}
\citation{paisI}
\citation{paisI}
\citation{paisI}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Operations on inversion sequences}{5}{subsection.1.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Statistics on inversion sequences}{5}{subsection.1.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.4}Ultimately constant avoidance sequences}{5}{subsection.1.4}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Characterizations of inversion sequences avoiding triples of relations.}}{6}{table.1}}
\newlabel{interesting}{{1}{6}{Characterizations of inversion sequences avoiding triples of relations}{table.1}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Patterns whose avoidance sequences appear to match sequences in the OEIS. Those marked as ``yes'' are cited, if known, and otherwise are proven in this paper.}}{7}{table.2}}
\newlabel{other triples}{{2}{7}{Patterns whose avoidance sequences appear to match sequences in the OEIS. Those marked as ``yes'' are cited, if known, and otherwise are proven in this paper}{table.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces The patterns whose avoidance sequences did not match sequences in the OEIS. (OEIS numbers in parentheses were newly assigned.)}}{8}{table.3}}
\newlabel{questions}{{3}{8}{The patterns whose avoidance sequences did not match sequences in the OEIS. (OEIS numbers in parentheses were newly assigned.)}{table.3}{}}
\citation{SimionSchmidt}
\citation{SimionSchmidt}
\@writefile{toc}{\contentsline {section}{\numberline {2}Patterns whose sequences appear in the OEIS}{9}{section.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Classes 7(A,B,C,D): $n$}{9}{subsection.2.1}}
\newlabel{section:7}{{2.1}{9}{Classes 7(A,B,C,D): $n$}{subsection.2.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Classes 12(A,B): $2(n-1)$ for $n>1$}{9}{subsection.2.2}}
\newlabel{section:12}{{2.2}{9}{Classes 12(A,B): $2(n-1)$ for $n>1$}{subsection.2.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Class 21: $F_{n+1}$}{9}{subsection.2.3}}
\newlabel{section:21}{{2.3}{9}{Class 21: $F_{n+1}$}{subsection.2.3}{}}
\citation{SimionSchmidt}
\citation{Sloane}
\citation{SimionSchmidt}
\citation{SimionSchmidt}
\newlabel{equation:21}{{1}{10}{}{equation.2.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}Classes 22(A,B,C): Lazy caterer sequence, ${n \atopwithdelims ()2} +1$}{10}{subsection.2.4}}
\newlabel{section:22}{{2.4}{10}{Classes 22(A,B,C): Lazy caterer sequence, ${n \choose 2} +1$}{subsection.2.4}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.1}Class {\bf  22A}: Avoiding $e_i < e_j \not =e_k$}{10}{subsubsection.2.4.1}}
\newlabel{equation:22A}{{2}{10}{}{equation.2.2}{}}
\newlabel{SimionSchmidtCaterer}{{8}{10}{Simion-Schmidt \cite {SimionSchmidt}}{theorem.8}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.2}Class {\bf  22B}: Avoiding $e_i < e_j$ and $e_i < e_k$}{11}{subsubsection.2.4.2}}
\newlabel{equation:22B}{{3}{11}{}{equation.2.3}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.3}Class {\bf  22C}: Avoiding $e_i \geq e_j \not =e_k$}{11}{subsubsection.2.4.3}}
\newlabel{equation:22C}{{4}{11}{}{equation.2.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.5}Classes 33(A,B): $F_{n+2}-1$}{11}{subsection.2.5}}
\newlabel{section:33}{{2.5}{11}{Classes 33(A,B): $F_{n+2}-1$}{subsection.2.5}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.5.1}Class {\bf  33A}: Avoiding $e_i \not = e_j \le e_k$}{11}{subsubsection.2.5.1}}
\newlabel{equation:33A}{{5}{11}{Class {\bf 33A}: Avoiding $e_i \not = e_j \le e_k$}{equation.2.5}{}}
\citation{paisI}
\citation{SimionSchmidt}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.5.2}Class {\bf  33B}: Avoiding $e_i \geq e_j \leq e_k$ and $e_i \not =e_k$}{12}{subsubsection.2.5.2}}
\newlabel{equation:21B}{{6}{12}{Class {\bf 33B}: Avoiding $e_i \geq e_j \leq e_k$ and $e_i \neq e_k$}{equation.2.6}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.6}Classes 64(A,B,C,D): $2^{n-1}$}{12}{subsection.2.6}}
\newlabel{section:64}{{2.6}{12}{Classes 64(A,B,C,D): $2^{n-1}$}{subsection.2.6}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.6.1}Class 64A: Avoiding $e_i = e_j < e_k$}{12}{subsubsection.2.6.1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.6.2}Class 64B: Avoiding $e_i<e_j\le e_k$}{12}{subsubsection.2.6.2}}
\citation{LS}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.6.3}Class {\bf  64C}: Avoiding $e_i<e_j \geq e_k$}{13}{subsubsection.2.6.3}}
\newlabel{theorem:64C}{{15}{13}{}{theorem.15}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.6.4}Class {\bf  64D}: Avoiding $e_i \leq e_j = e_k$}{13}{subsubsection.2.6.4}}
\newlabel{theorem:64D}{{17}{13}{}{theorem.17}{}}
\citation{LS}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.7}Classes 121(A,B,C): Grassmannian permutations, $2^n-n$}{14}{subsection.2.7}}
\newlabel{section:121}{{2.7}{14}{Classes 121(A,B,C): Grassmannian permutations, $2^n-n$}{subsection.2.7}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.7.1}Class {\bf  121A}: Avoiding $e_i\not =e_j < e_k$}{14}{subsubsection.2.7.1}}
\newlabel{thm:121A}{{18}{14}{}{theorem.18}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.7.2}Class {\bf  121B}: Avoiding $e_i\not =e_j \not =e_k$ and $e_i \not =e_k$}{14}{subsubsection.2.7.2}}
\newlabel{thm:121B}{{19}{14}{}{theorem.19}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.7.3}Class {\bf  121C}: Avoiding $e_j \geq e_k $ and $e_i \not =e_k$ }{14}{subsubsection.2.7.3}}
\citation{Sloane}
\citation{LS}
\citation{BJS}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.8}Class 151: $321$-avoiding separable permutations}{15}{subsection.2.8}}
\newlabel{section:151}{{2.8}{15}{Class 151: $321$-avoiding separable permutations}{subsection.2.8}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.9}Class 185: 321-avoiding vexillary permutations, $2^{n+1}-{n+1 \atopwithdelims ()3}-2n-1$ }{15}{subsection.2.9}}
\newlabel{section:185}{{2.9}{15}{Class 185: 321-avoiding vexillary permutations, $2^{n+1}-{n+1 \choose 3}-2n-1$}{subsection.2.9}{}}
\citation{Sloane}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.10}Class 187: Conjectured to be counted by A049125}{16}{subsection.2.10}}
\newlabel{section:187}{{2.10}{16}{Class 187: Conjectured to be counted by A049125}{subsection.2.10}{}}
\citation{paisI}
\citation{tenner}
\citation{Ptenner}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.11}Class 193: $\mathbf  {S}_n(132,4312)$, $(n-1)2^{n-2} +1$}{17}{subsection.2.11}}
\newlabel{section:193}{{2.11}{17}{Class 193: $\Sn _n(132,4312)$, $(n-1)2^{n-2} +1$}{subsection.2.11}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.12}Class 233: $\mathbf  {I}_n(012)$, $F_{2n-1}$}{17}{subsection.2.12}}
\newlabel{section:233}{{2.12}{17}{Class 233: $\I _n(012)$, $F_{2n-1}$}{subsection.2.12}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.13}Class 304: Conjectured to be counted by A229046}{17}{subsection.2.13}}
\newlabel{section:304}{{2.13}{17}{Class 304: Conjectured to be counted by A229046}{subsection.2.13}{}}
\citation{macmahon}
\citation{SimionSchmidt}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.14}Classes 429(A,B,C): Catalan numbers}{18}{subsection.2.14}}
\newlabel{section:429}{{2.14}{18}{Classes 429(A,B,C): Catalan numbers}{subsection.2.14}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.1}Class {\bf  429A}: Avoiding $e_j > e_k$}{18}{subsubsection.2.14.1}}
\citation{PAISII}
\citation{KimLin}
\citation{PAISII}
\citation{Sloane}
\citation{Sloane}
\citation{Sloane}
\citation{callan11}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.2}Class {\bf  429B}: Avoiding $e_j \geq e_k$ and $e_i <e_k$}{19}{subsubsection.2.14.2}}
\newlabel{equation:429B}{{7}{19}{Class {\bf 429B}: Avoiding $e_j \geq e_k$ and $e_i <e_k$}{equation.2.7}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.3}Class {\bf  429C}: Avoiding $e_i \geq e_j $ and $e_i \geq e_k$ }{19}{subsubsection.2.14.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.15}Class 523: $\mathbf  {S}_n({\mathaccentV {bar}016{3}} {\mathaccentV {bar}016{1}} 542)$ and the nexus numbers}{19}{subsection.2.15}}
\newlabel{section:523}{{2.15}{19}{Class 523: $\Sn _n({\bar {3}} {\bar {1}} 542)$ and the nexus numbers}{subsection.2.15}{}}
\citation{Sloane}
\citation{PAISII}
\citation{BMX}
\citation{Lin}
\citation{Yan}
\citation{Lin}
\citation{Yan}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.16}Classes 772(A,B): Set partitions avoiding enhanced 3-cross\discretionary {-}{}{}ings}{20}{subsection.2.16}}
\newlabel{section:772}{{2.16}{20}{Classes 772(A,B): Set partitions avoiding enhanced 3-cross\-ings}{subsection.2.16}{}}
\newlabel{observation:772B}{{31}{21}{}{theorem.31}{}}
\newlabel{observation:772A}{{32}{21}{}{theorem.32}{}}
\newlabel{theorem:772A,B}{{33}{21}{}{theorem.33}{}}
\citation{Callan06}
\citation{paisI}
\citation{stanleyI}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.17}Classes 877(A,B,C,D): Bell numbers and Stirling numbers}{22}{subsection.2.17}}
\newlabel{section:877}{{2.17}{22}{Classes 877(A,B,C,D): Bell numbers and Stirling numbers}{subsection.2.17}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.17.1}Class {\bf  877A}: Avoiding $e_i < e_j =e_k$}{22}{subsubsection.2.17.1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.17.2}Class {\bf  877B}: Avoiding $e_i = e_j \geq e_k$}{22}{subsubsection.2.17.2}}
\citation{Sloane}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.17.3}Class {\bf  877C}: Avoiding $ e_i \not =e_j \not =e_k$ and $e_i=e_k$}{23}{subsubsection.2.17.3}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.17.4}Class {\bf  877D}: Avoiding $e_i \geq e_j$ and $e_i=e_k$}{23}{subsubsection.2.17.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.18}Class 924: Central binomial coefficients}{23}{subsection.2.18}}
\newlabel{section:924}{{2.18}{23}{Class 924: Central binomial coefficients}{subsection.2.18}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.19}Class 1064: Conjectured to be counted by A071356}{23}{subsection.2.19}}
\newlabel{section:1064}{{2.19}{23}{Class 1064: Conjectured to be counted by A071356}{subsection.2.19}{}}
\citation{BS}
\citation{BS}
\citation{AHPSV}
\citation{paisI}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.20}Class 1265: $\mathbf  {S}_n(2143,3142,4132)$ }{24}{subsection.2.20}}
\newlabel{section:1265}{{2.20}{24}{Class 1265: $\Sn _n(2143,3142,4132)$}{subsection.2.20}{}}
\newlabel{1265}{{2.20}{24}{Class 1265: $\Sn _n(2143,3142,4132)$}{subsection.2.20}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.21}Class 1347: Conjectured to be counted by $\mathbf  {S}_n(4123,4132,4213)$}{24}{subsection.2.21}}
\newlabel{section:1347}{{2.21}{24}{Class 1347: Conjectured to be counted by $\Sn _n(4123,4132,4213)$}{subsection.2.21}{}}
\citation{sundaram}
\citation{paisI}
\citation{paisI}
\citation{Sloane}
\citation{Mansour}
\citation{Mansour}
\citation{kremer}
\citation{paisI}
\citation{paisI}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.22}Class 1385: $\mathbf  {I}_n(000)$ and the Euler up/down numbers}{25}{subsection.2.22}}
\newlabel{section:1385}{{2.22}{25}{Class 1385: $\I _n(000)$ and the Euler up/down numbers}{subsection.2.22}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.23}Class 1694: $\mathbf  {I}_n(102)$}{25}{subsection.2.23}}
\newlabel{section:1694}{{2.23}{25}{Class 1694: $\I _n(102)$}{subsection.2.23}{}}
\newlabel{1694}{{8}{25}{Class 1694: $\I _n(102)$}{equation.2.8}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.24}1806(A,B,C,D): large Schr\"oder numbers}{25}{subsection.2.24}}
\newlabel{section:1806}{{2.24}{25}{1806(A,B,C,D): large Schr\"oder numbers}{subsection.2.24}{}}
\citation{kremer}
\citation{kitaev}
\citation{KimLin}
\citation{FuLinZeng}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.24.1}Class {\bf  1806A}: Avoiding $e_j > e_k$ and $e_i < e_k$}{26}{subsubsection.2.24.1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.24.2}Class {\bf  1806B}: Avoiding $e_i > e_j$ and $e_i \geq e_k$ }{26}{subsubsection.2.24.2}}
\citation{kremer}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.24.3}Class {\bf  1806C}: Avoiding $e_i \geq e_j$ and $e_i >e_k$}{27}{subsubsection.2.24.3}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.24.4}Class {\bf  1806D}: Avoiding $e_i \geq e_j \not = e_k$ and $e_i \geq e_k$}{27}{subsubsection.2.24.4}}
\newlabel{def phi}{{42}{27}{}{theorem.42}{}}
\newlabel{thm:1806D}{{45}{28}{}{theorem.45}{}}
\citation{KimLin}
\citation{PAISII}
\citation{chung}
\citation{KimLin}
\citation{KimLin}
\citation{albert2549}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.25}Class 2074: Baxter numbers}{29}{subsection.2.25}}
\newlabel{section:2074}{{2.25}{29}{Class 2074: Baxter numbers}{subsection.2.25}{}}
\citation{Sloane}
\citation{PAISII}
\citation{BouvelGuerriniEtAl}
\citation{BouvelGuerriniEtAl}
\citation{BMB}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.26}Classes 2549(A,B,C): Conjectured to be counted by \penalty \z@ $\mathbf  {S}_n(4231,\penalty \z@ 42513)$}{30}{subsection.2.26}}
\newlabel{section:2549}{{2.26}{30}{Classes 2549(A,B,C): Conjectured to be counted by \allowbreak $\Sn _n(4231,\allowbreak 42513)$}{subsection.2.26}{}}
\newlabel{thm:2549AC}{{47}{30}{}{theorem.47}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.27}Classes 2958(A,B,C,D): Plane permutations and the semi-Baxter numbers}{30}{subsection.2.27}}
\newlabel{section:2958}{{2.27}{30}{Classes 2958(A,B,C,D): Plane permutations and the semi-Baxter numbers}{subsection.2.27}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.27.1}Class {\bf  2958A}: Avoiding $e_j < e_k$ and $ e_i\geq e_k$}{31}{subsubsection.2.27.1}}
\citation{paisI}
\citation{paisI}
\citation{BouvelGuerriniEtAl}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.27.2}Class {\bf  2958B}: Avoiding $e_i > e_j \geq e_k$}{32}{subsubsection.2.27.2}}
\newlabel{characterize2958B}{{50}{32}{}{theorem.50}{}}
\newlabel{Snab:recurrence}{{52}{32}{}{theorem.52}{}}
\newlabel{rec:210and100}{{52}{32}{}{theorem.52}{}}
\newlabel{count210}{{9}{32}{Class {\bf 2958B}: Avoiding $e_i > e_j \geq e_k$}{equation.2.9}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.27.3}Class {\bf  2958C}: Avoiding $e_i \geq e_j > e_k$}{33}{subsubsection.2.27.3}}
\newlabel{thm:2958BC}{{53}{33}{}{theorem.53}{}}
\newlabel{alpha}{{10}{33}{Class {\bf 2958C}: Avoiding $e_i \geq e_j > e_k$}{equation.2.10}{}}
\newlabel{alphaprop1}{{11}{33}{Class {\bf 2958C}: Avoiding $e_i \geq e_j > e_k$}{equation.2.11}{}}
\newlabel{alphaprop2}{{12}{33}{Class {\bf 2958C}: Avoiding $e_i \geq e_j > e_k$}{equation.2.12}{}}
\citation{paisI}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.27.4}{\bf  2958D}: Avoiding $e_j \leq e_k$ and $e_i > e_k$}{34}{subsubsection.2.27.4}}
\newlabel{2958BD}{{54}{34}{}{theorem.54}{}}
\citation{paisI}
\citation{Sloane}
\citation{callan10}
\citation{paisI}
\citation{Sloane}
\citation{KitaevRemmel}
\citation{KitaevRemmel}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.28}Classes 3207(A,B): $\mathbf  {I}_n(101)$, $\mathbf  {I}_n(110)$ }{35}{subsection.2.28}}
\newlabel{section:3207}{{2.28}{35}{Classes 3207(A,B): $\I _n(101)$, $\I _n(110)$}{subsection.2.28}{}}
\newlabel{callan}{{13}{35}{Classes 3207(A,B): $\I _n(101)$, $\I _n(110)$}{equation.2.13}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.29}Class 3720: Quadrant Marked Mesh Patterns}{35}{subsection.2.29}}
\newlabel{section:3720}{{2.29}{35}{Class 3720: Quadrant Marked Mesh Patterns}{subsection.2.29}{}}
\citation{Sloane}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.30}Class 5040: $n!$}{36}{subsection.2.30}}
\newlabel{section:5040}{{2.30}{36}{Class 5040: $n!$}{subsection.2.30}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Results about patterns whose sequences don't appear in the OEIS \cite  {Sloane}}{37}{section.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Counting results}{37}{subsection.3.1}}
\newlabel{counting}{{3.1}{37}{Counting results}{subsection.3.1}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.1}Class 805: Avoiding $e_i \leq e_j > e_k$ and $e_i \not =e_k$}{37}{subsubsection.3.1.1}}
\newlabel{section:805}{{3.1.1}{37}{Class 805: Avoiding $e_i \leq e_j > e_k$ and $e_i \neq e_k$}{subsubsection.3.1.1}{}}
\citation{paisI}
\citation{Mansour}
\citation{paisI}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.2}Class {\bf  1016}: Avoiding $e_i > e_j$ and $e_i \not = e_k$}{38}{subsubsection.3.1.2}}
\newlabel{section:1016}{{3.1.2}{38}{Class {\bf 1016}: Avoiding $e_i > e_j$ and $e_i \not = e_k$}{subsubsection.3.1.2}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.3}1079(A,B): sum of binomial coefficients}{38}{subsubsection.3.1.3}}
\newlabel{section:1079}{{3.1.3}{38}{1079(A,B): sum of binomial coefficients}{subsubsection.3.1.3}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.4}4306A,B: $\mathbf  {I}_n(210)$, $\mathbf  {I}_n(201)$}{39}{subsubsection.3.1.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Wilf-equivalence results}{39}{subsection.3.2}}
\newlabel{equivalences}{{3.2}{39}{Wilf-equivalence results}{subsection.3.2}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Class {\bf  1953A}: Avoiding $e_j>e_k$ and $e_i>e_k$, and Class {\bf  1953B}: Avoiding $e_i \not =e_j \geq e_k$ and $e_i>e_k$}{39}{subsubsection.3.2.1}}
\newlabel{thm:1953AB}{{60}{39}{}{theorem.60}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Class {\bf  1833A}: Avoiding $e_j \not =e_k$ and $e_i>e_k$, and Class {\bf  1833B}: Avoiding $e_i \not =e_j$ and $e_i>e_k$}{40}{subsubsection.3.2.2}}
\newlabel{thm:1833AB}{{61}{40}{}{theorem.61}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.3}Class {\bf  746A}: Avoiding $e_j > e_k$ and $e_i \geq e_k$, and Class {\bf  746B}: Avoiding $e_i \not =e_j \geq e_k$ and $e_i \geq e_k$}{40}{subsubsection.3.2.3}}
\newlabel{thm:746AB}{{62}{40}{}{theorem.62}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.4}Class {\bf  663A}: Avoiding $e_j \not =e_k$ and $ e_i \geq e_k$, and Class {\bf  663B}: Avoiding $e_i \not =e_j$ and $e_i \geq e_k$}{40}{subsubsection.3.2.4}}
\newlabel{thm:663AB}{{63}{40}{}{theorem.63}{}}
\citation{survey}
\citation{PermLab1.0}
\@writefile{toc}{\contentsline {section}{\numberline {4}Concluding remarks}{41}{section.4}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Acknowledgments}{41}{section.5}}
\citation{Sloane}
\bibcite{albert2549}{1}
\bibcite{PermLab1.0}{2}
\bibcite{AHPSV}{3}
\bibcite{BJS}{4}
\bibcite{BMB}{5}
\bibcite{BMX}{6}
\bibcite{BouvelGuerriniEtAl}{7}
\bibcite{BS}{8}
\bibcite{Callan06}{9}
\bibcite{callan10}{10}
\bibcite{callan11}{11}
\bibcite{chung}{12}
\bibcite{paisI}{13}
\bibcite{FuLinZeng}{14}
\bibcite{Sloane}{15}
\bibcite{KimLin}{16}
\bibcite{kitaev}{17}
\bibcite{KitaevRemmel}{18}
\bibcite{kremer}{19}
\bibcite{LS}{20}
\bibcite{Lin}{21}
\bibcite{macmahon}{22}
\bibcite{Mansour}{23}
\bibcite{PAISII}{24}
\bibcite{Ptenner}{25}
\bibcite{survey}{26}
\bibcite{SimionSchmidt}{27}
\bibcite{stanleyI}{28}
\bibcite{sundaram}{29}
\bibcite{tenner}{30}
\bibcite{Yan}{31}