{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T01:23:59Z","timestamp":1784856239932,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":4039,"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":[[2002,8]]},"DOI":"10.1016\/s0196-8858(02)00012-x","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T07:25:55Z","timestamp":1034061955000},"page":"293-310","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Counting occurrences of a\u00a0pattern of type (1,2) or (2,1) in permutations"],"prefix":"10.1016","volume":"29","author":[{"given":"Anders","family":"Claesson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toufik","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0196-8858(02)00012-X_BIB001","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/jcta.1999.3002","article-title":"On the number of permutations avoiding a given pattern","volume":"89","author":"Alon","year":"2000","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_BIB002","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","article-title":"Restricted permutations","volume":"195","author":"Atkinson","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-8858(02)00012-X_BIB003","article-title":"Generalized permutation patterns and a classification of the Mahonian statistics","volume":"44","author":"Babson","year":"2000","journal-title":"S\u00e9m. Lothar. Combin."},{"issue":"2","key":"10.1016\/S0196-8858(02)00012-X_BIB004","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jcta.1997.2800","article-title":"Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps","volume":"80","author":"B\u00f3na","year":"1997","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"10.1016\/S0196-8858(02)00012-X_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."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_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."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_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."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_BIB008","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(98)00384-7","article-title":"Forbidden subsequences and Chebyshev polynomials","volume":"204","author":"Chow","year":"1999","journal-title":"Discrete Math."},{"issue":"7","key":"10.1016\/S0196-8858(02)00012-X_BIB009","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1006\/eujc.2001.0515","article-title":"Generalized pattern avoidance","volume":"22","author":"Claesson","year":"2001","journal-title":"European J. Combin."},{"issue":"3","key":"10.1016\/S0196-8858(02)00012-X_BIB010","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/aama.1996.0506","article-title":"New Euler\u2013Mahonian statistics on permutations and words","volume":"18","author":"Clarke","year":"1997","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/S0196-8858(02)00012-X_BIB011","series-title":"Formal Power Series and Algebraic Combinatorics, Tempe, 2001","first-page":"179","article-title":"Enumeration of subwords in permutations","author":"Elizalde","year":"2001"},{"key":"10.1016\/S0196-8858(02)00012-X_BIB012","series-title":"Concrete Mathematics","author":"Graham","year":"1994"},{"key":"10.1016\/S0196-8858(02)00012-X_BIB013","series-title":"Formal Power Series and Algebraic Combinatorics, Moscow, 2000","first-page":"704","article-title":"Permutations containing and avoiding certain patterns","author":"Mansour","year":"2000"},{"key":"10.1016\/S0196-8858(02)00012-X_BIB014","article-title":"Counting occurrences of 132 in a permutation","author":"Mansour","year":"2001","journal-title":"Adv. in Appl. Math."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_BIB015","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 three","volume":"152","author":"Noonan","year":"1996","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/S0196-8858(02)00012-X_BIB016","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."},{"issue":"4","key":"10.1016\/S0196-8858(02)00012-X_BIB017","first-page":"151","article-title":"Permutations containing and avoiding 123 and 132 patterns","volume":"3","author":"Robertson","year":"1999","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/S0196-8858(02)00012-X_BIB018","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."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_BIB019","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","article-title":"Forbidden subsequences","volume":"132","author":"Stankova","year":"1994","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/S0196-8858(02)00012-X_BIB020","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/eujc.1996.0044","article-title":"Classification of forbidden subsequences of length 4","volume":"17","author":"Stankova","year":"1996","journal-title":"European J. Combin."},{"issue":"1\u20133","key":"10.1016\/S0196-8858(02)00012-X_BIB021","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","article-title":"Generating trees and the Catalan and Schr\u00f6der numbers","volume":"146","author":"West","year":"1995","journal-title":"Discrete Math."}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019688580200012X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019688580200012X?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:11Z","timestamp":1759301051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019688580200012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S019688580200012X"],"URL":"https:\/\/doi.org\/10.1016\/s0196-8858(02)00012-x","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Counting occurrences of a\u00a0pattern of type (1,2) or (2,1) in permutations","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0196-8858(02)00012-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}