A224179 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A224179

Number of permutations of length n containing exactly 1 occurrence of 1243.

0

0, 0, 0, 1, 11, 88, 638, 4478, 31199, 218033, 1535207, 10910759, 78310579, 567588264, 4152765025, 30656248812, 228215224472, 1712296117750, 12941799657414, 98486737654025, 754273093950128, 5811161481943201, 45020589539040033, 350604675228411590, 2743720335733822423

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

Table of n, a(n) for n=1..25.

Andrew R. Conway and Anthony J. Guttmann, Counting occurrences of patterns in permutations, arXiv:2306.12682 [math.CO], 2023. See pp. 16, 20.

Brian Nakamura, Approaches for enumerating permutations with a prescribed number of occurrences of patterns, PU. M. A. 24 (2013), 179-194.

Brian Nakamura, Approaches for enumerating permutations with a prescribed number of occurrences of patterns, arXiv 1301.5080, 2013

MAPLE

Programs can be obtained from the arXiv 1301.5080 link.

CROSSREFS

Sequence in context: A022735 A346448 A173731 * A037601 A037706 A175605

Adjacent sequences: A224176 A224177 A224178 * A224180 A224181 A224182

KEYWORD

nonn

AUTHOR

Brian Nakamura, Apr 01 2013

STATUS

approved