[
[1] M. Bona, Combinatorics of Permutations, Chapman & Hall/CRC, Boca Raton, FL, 2004.10.1201/9780203494370
]Search in Google Scholar
[
[2] M. Bona, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Combin. Theory Ser. A, 80 (1997) 257–272.
]Search in Google Scholar
[
[3] A. M. Baxter, Shape-Wilf-equivalences for vincular patterns, Adv. in Appl. Math., 50 (2013) 723—736.
]Search in Google Scholar
[
[4] N. R. Beaton, M. Bouvel, V. Guerrini and S. Rinaldi, Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers, Theoret. Comput. Sci., 777 (2019) 69—92.
]Search in Google Scholar
[
[5] E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, ECO: a methodology for the enumeration of combinatorial objects, J. Difference Equ. Appl., 5 (1999) 435-–490.10.1080/10236199908808200
]Search in Google Scholar
[
[6] A. Bernini and L. Ferrari, Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset, Ann. Combin., 21 (2017) 519–534.
]Search in Google Scholar
[
[7] D.Callan, A bijection to count (1-23-4)-avoiding permutations, arXiv:1008.2375.
]Search in Google Scholar
[
[8] A. Claesson, Generalized pattern avoidance, European J. Combin., 22 (2001) 961–971.
]Search in Google Scholar
[
[9] S. Corteel, M. A. Martinez, C. D. Savage, and M. Weselcouch, Patterns in inversion sequences I, Discrete Math. Theor. Comput. Sci., 18(2) (2016) #2.10.46298/dmtcs.1323
]Search in Google Scholar
[
[10] E. Duchi, V. Guerrini and S. Rinaldi, A generating tree for permutations avoiding the pattern 122+3, Fund. Inform., 163 (2018) 21–39.
]Search in Google Scholar
[
[11] S. Elizalde, Asymptotic enumeration of permutations avoiding generalized patterns, Adv. in Appl.Math., 36 (2006) 138-–155.
]Search in Google Scholar
[
[12] S. Elizalde and M. Noy, Consecutive patterns in permutations, Adv. in Appl. Math., 30 (2003) 110–125.
]Search in Google Scholar
[
[13] P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, 2009.10.1017/CBO9780511801655
]Search in Google Scholar
[
[14] S. Kitaev, Patterns in Permutations and Words, Monographs in Theoretical Computer Science. Springer, Heidelberg, 2011.10.1007/978-3-642-17333-2
]Search in Google Scholar
[
[15] S. Kitaev, Partially ordered generalized patterns, Discrete Math., 298 (2005) 212–229.
]Search in Google Scholar
[
[16] Z. Lin and S. Fu, On 120-avoiding inversion and ascent sequences, arXiv:2003.11813.
]Search in Google Scholar
[
[17] J. Noonan and D. Zeilberger, The enumeration of permutations with a prescribed number of forbidden patterns, Adv. in Appl. Math., 17 (1996) 381 – 407.
]Search in Google Scholar
[
[18] N. J. A. Sloane, The On-line Encyclopedia of Integer Sequences, at oeis.org.
]Search in Google Scholar
[
[19] E. Steingrímsson, Generalized permutation patterns – a short survey, Permutation Patterns, vol. 376 of London Math. Soc. Lecture Note Series, pp. 137 – 152, Cambridge University Press, Cambridge, 2010.10.1017/CBO9780511902499.007
]Search in Google Scholar
