@article{NOONAN1996381,
    abstract = {We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of “forbidden” patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns “abc,” “cab,” and “abcd.”},
    author = {John Noonan and Doron Zeilberger},
    date-added = {2023-11-6 16:12:50 +0100},
    issn = {0196-8858},
    journal = {Advances in Applied Mathematics},
    number = {4},
    pages = {381-407},
    title = {The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns},
    url = {https://www.sciencedirect.com/science/article/pii/S0196885896900160},
    volume = {17},
    year = {1996},
    doi = {10.1006/aama.1996.0016}
}

@article{NOONAN1996381, abstract = {We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of “forbidden” patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns “abc,” “cab,” and “abcd.”}, author = {John Noonan and Doron Zeilberger}, date-added = {2023-11-6 16:12:50 +0100}, issn = {0196-8858}, journal = {Advances in Applied Mathematics}, number = {4}, pages = {381-407}, title = {The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns}, url = {https://www.sciencedirect.com/science/article/pii/S0196885896900160}, volume = {17}, year = {1996}, doi = {10.1006/aama.1996.0016} }