Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13
Journal of integer sequences, Tome 9 (2006) no. 3
We count the number of permutations with $k$ occurrences of the pattern 2-13 in permutations by lattice path enumeration. We give closed forms for $k = 8$, extending results of Claesson and Mansour.
Classification :
05A05, 05A15
Keywords: permutations, restricted pattern, Motzkin paths, generating functions
Keywords: permutations, restricted pattern, Motzkin paths, generating functions
@article{JIS_2006__9_3_a3,
author = {Parviainen, Robert},
title = {Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13},
journal = {Journal of integer sequences},
year = {2006},
volume = {9},
number = {3},
zbl = {1101.05007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2006__9_3_a3/}
}
Parviainen, Robert. Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13. Journal of integer sequences, Tome 9 (2006) no. 3. http://geodesic.mathdoc.fr/item/JIS_2006__9_3_a3/