{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:01:05Z","timestamp":1760954465010,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0196-8858(02)00501-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T18:40:50Z","timestamp":1052764850000},"page":"607-632","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Enumeration of permutations containing a\u00a0prescribed number of occurrences of a\u00a0pattern of length three"],"prefix":"10.1016","volume":"30","author":[{"given":"Markus","family":"Fulmek","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-8858(02)00501-8_BIB001","series-title":"Proc. of the 9th FPSAC, Vienna","first-page":"49","article-title":"Permutations with one forbidden subsequence of increasing length","author":"Barcucci","year":"1997"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB002","series-title":"Proc. of the 10th FPSAC, Toronto","first-page":"31","article-title":"From cn to n!: Permutations avoiding sj(j+1)(j+2)","author":"Barcucci","year":"1998"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB003","first-page":"31","article-title":"Permutations avoiding an increasing number of length-increasing forbidden subsequences","volume":"4","author":"Barcucci","year":"2000","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB004","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jcta.1997.2800","article-title":"Exact enumeration of 1342-avoiding permutation: A close link with labelled trees and planar maps","volume":"80","author":"B\u00f3na","year":"1997","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB005","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1006\/aama.1997.0528","article-title":"The number of permutations with exactly r 132-subsequences is P-recursive in the size!","volume":"18","author":"B\u00f3na","year":"1997","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB006","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(96)00140-9","article-title":"Permutations avoiding certain patterns: The case of length 4 and some generalizations","volume":"175","author":"B\u00f3na","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB007","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(97)00062-9","article-title":"Permutations with one or two 132-subsequences","volume":"181","author":"B\u00f3na","year":"1998","journal-title":"Discrete Math."},{"author":"Egge","key":"10.1016\/S0196-8858(02)00501-8_BIB008"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB009","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1006\/aama.2001.0747","article-title":"Permutations with restricted patterns and Dyck paths","volume":"27","author":"Krattenthaler","year":"2001","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB010","unstructured":"T. Mansour, Private communication, 2001"},{"author":"Mansour","key":"10.1016\/S0196-8858(02)00501-8_BIB011"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB012","unstructured":"T. Mansour, A. Vainshtein, Layered restrictions and Chebyshev polynomials, Ann. Combin., in print"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB013","doi-asserted-by":"crossref","first-page":"R17","DOI":"10.37236\/1495","article-title":"Restricted permutations, continued fractions and Chebyshev polynomials","volume":"7","author":"Mansour","year":"2000","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB014","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/aama.2000.0719","article-title":"Restricted (132)-avoiding permutations","volume":"26","author":"Mansour","year":"2001","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB015","first-page":"17","article-title":"Restricted permutations and Chebyshev polynomials","volume":"47","author":"Mansour","year":"2001","journal-title":"S\u00e9m. Lothar. Combin."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB016","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(95)00247-T","article-title":"The number of permutations containing exactly one increasing subsequence of length 3","volume":"152","author":"Noonan","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB017","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/aama.1996.0016","article-title":"The enumeration of permutations with a prescribed number of \u201cforbidden\u201d patterns","volume":"17","author":"Noonan","year":"1996","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB018","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1006\/aama.2001.0749","article-title":"Permutations restricted by two distinct patterns of length three","volume":"27","author":"Robertson","year":"2001","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB019","doi-asserted-by":"crossref","first-page":"R38","DOI":"10.37236\/1470","article-title":"Permutation patterns and continued fractions","volume":"6","author":"Robertson","year":"1999","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0196-8858(02)00501-8_BIB020","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","article-title":"Restricted permutations","volume":"6","author":"Simion","year":"1985","journal-title":"European J. Combin."},{"year":"1986","series-title":"Enumerative Combinatorics 1","author":"Stanley","key":"10.1016\/S0196-8858(02)00501-8_BIB021"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB022","article-title":"Enumerative Combinatorics 2","volume":"62","author":"Stanley","year":"1999"},{"key":"10.1016\/S0196-8858(02)00501-8_BIB023","unstructured":"J. West, Permutations with forbidden subsequences; and, stack sortable permutations, PhD thesis, Massachusetts Institute of Technology, 1990"}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:44:49Z","timestamp":1759301089000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885802005018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0196885802005018"],"URL":"https:\/\/doi.org\/10.1016\/s0196-8858(02)00501-8","relation":{},"ISSN":["0196-8858"],"issn-type":[{"type":"print","value":"0196-8858"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumeration of permutations containing a\u00a0prescribed number of occurrences of a\u00a0pattern of length three","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0196-8858(02)00501-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}