\begin{thebibliography}{10}

\bibitem{1324}
{\sc Albert, M., Elder, M., Rechnitzer, A., Westcott, P., and Zabrocki, M.}
\newblock On the {W}ilf-{S}tanley limit of $4231$-avoiding permutations and a
  conjecture of arratia.
\newblock
  \href{http://front.math.ucdavis.edu/math.CO/0502504}{arXiv:math.CO/0502504}.

\bibitem{arratia}
{\sc Arratia, R.}
\newblock On the {S}tanley-{W}ilf conjecture for the number of permutations
  avoiding a given pattern.
\newblock {\em Electron. J. Combin. 6\/} (1999), Note, N1, 4 pp. (electronic).

\bibitem{a:rp}
{\sc Atkinson, M.~D.}
\newblock Restricted permutations.
\newblock {\em Discrete Math. 195}, 1-3 (1999), 27--38.

\bibitem{amr:twostacks}
{\sc Atkinson, M.~D., Murphy, M.~M., and Ru{\v{s}}kuc, N.}
\newblock Sorting with two ordered stacks in series.
\newblock {\em Theoret. Comput. Sci. 289}, 1 (2002), 205--223.

\bibitem{bona:notint}
{\sc B{\'o}na, M.}
\newblock The limit of a {S}tanley-{W}ilf sequence is not always an integer!
\newblock {\it J. Comb. Theory, Ser. A\/}, to appear.

\bibitem{bona:parity}
{\sc B\'ona, M.}
\newblock Parity and stack sortability.
\newblock in preparation.

\bibitem{b:1342}
{\sc B{\'o}na, M.}
\newblock Exact enumeration of {$1342$}-avoiding permutations: a close link
  with labeled trees and planar maps.
\newblock {\em J. Combin. Theory Ser. A 80}, 2 (1997), 257--272.

\bibitem{bona:layered}
{\sc B{\'o}na, M.}
\newblock The solution of a conjecture of {S}tanley and {W}ilf for all layered
  patterns.
\newblock {\em J. Combin. Theory Ser. A 85}, 1 (1999), 96--104.

\bibitem{bona:stacksurvey}
{\sc B{\'o}na, M.}
\newblock A survey of stack-sorting disciplines.
\newblock {\em Electron. J. Combin. 9}, 2 (2002/03), Article 1, 16 pp.
  (electronic).

\bibitem{bona:book}
{\sc B{\'o}na, M.}
\newblock {\em Combinatorics of permutations}.
\newblock Discrete Mathematics and its Applications (Boca Raton). Chapman \&
  Hall/CRC, Boca Raton, FL, 2004.

\bibitem{gessel}
{\sc Gessel, I.~M.}
\newblock Symmetric functions and {$P$}-recursiveness.
\newblock {\em J. Combin. Theory Ser. A 53}, 2 (1990), 257--285.

\bibitem{kk:growth}
{\sc Kaiser, T., and Klazar, M.}
\newblock On growth rates of closed permutation classes.
\newblock {\em Electron. J. Combin. 9}, 2 (2002/03), Research paper 10, 20 pp.
  (electronic).

\bibitem{km:survey}
{\sc Kitaev, S., and Mansour, T.}
\newblock A survey on certain pattern problems.
\newblock University of Kentucky research report 2003--09, available at
  \url{http://www.ms.uky.edu/~math/MAreport/survey.ps}.

\bibitem{mt:swc}
{\sc Marcus, A., and Tardos, G.}
\newblock Excluded permutation matrices and the {S}tanley-{W}ilf conjecture.
\newblock {\em J. Combin. Theory Ser. A 107}, 1 (2004), 153--160.

\bibitem{mr:1324}
{\sc Marinov, D., and Radoi{\v{c}}i{\'c}, R.}
\newblock Counting 1324-avoiding permutations.
\newblock {\em Electron. J. Combin. 9}, 2 (2002/03), Research paper 13, 9 pp.
  (electronic).

\bibitem{maximillian}
{\sc Murphy, M.~M.}
\newblock {\em Restricted permutations, antichains, atomic classes, and stack
  sorting}.
\newblock PhD thesis, Univ. of St. Andrews, 2002.

\bibitem{nz:copies}
{\sc Noonan, J., and Zeilberger, D.}
\newblock The enumeration of permutations with a prescribed number of
  ``forbidden'' patterns.
\newblock {\em Adv. in Appl. Math. 17}, 4 (1996), 381--407.

\bibitem{regev}
{\sc Regev, A.}
\newblock Asymptotic values for degrees associated with strips of {Y}oung
  diagrams.
\newblock {\em Adv. in Math. 41}, 2 (1981), 115--136.

\bibitem{sw:comp}
{\sc Savage, C.~D., and Wilf, H.~S.}
\newblock Pattern avoidance in compositions and multiset permutations.
\newblock
  \href{http://front.math.ucdavis.edu/math.CO/0504310}{arXiv:math.CO/0504310}.

\bibitem{smith:sorting}
{\sc Smith, R.}
\newblock Comparing algorithms for sorting with {$t$} stacks in series.
\newblock {\em Ann. Comb. 8}, 1 (2004), 113--121.

\bibitem{stankova:len4}
{\sc Stankova, Z.}
\newblock Classification of forbidden subsequences of length {$4$}.
\newblock {\em European J. Combin. 17}, 5 (1996), 501--517.

\bibitem{sw:wilf}
{\sc Stankova, Z., and West, J.}
\newblock A new class of {W}ilf-equivalent permutations.
\newblock {\em J. Algebraic Combin. 15}, 3 (2002), 271--290.

\bibitem{stankova:fs}
{\sc Stankova, Z.~E.}
\newblock Forbidden subsequences.
\newblock {\em Discrete Math. 132}, 1-3 (1994), 291--316.

\bibitem{stanley:prec}
{\sc Stanley, R.~P.}
\newblock Differentiably finite power series.
\newblock {\em European J. Combin. 1}, 2 (1980), 175--188.

\bibitem{tarjan:sorting}
{\sc Tarjan, R.}
\newblock Sorting using networks of queues and stacks.
\newblock {\em J. Assoc. Comput. Mach. 19\/} (1972), 341--346.

\bibitem{wilfplus:prog}
{\sc Vatter, V.~R.}
\newblock {\sc WilfPlus}.
\newblock Available at
  \url{http://www.math.rutgers.edu/~vatter/programs/wilfplus/}.

\bibitem{west:cat}
{\sc West, J.}
\newblock Generating trees and the {C}atalan and {S}chr\"oder numbers.
\newblock {\em Discrete Math. 146}, 1-3 (1995), 247--262.

\bibitem{z:holo1}
{\sc Zeilberger, D.}
\newblock A holonomic systems approach to special functions identities.
\newblock {\em J. Comput. Appl. Math. 32}, 3 (1990), 321--368.

\end{thebibliography}