login
A309505
Number of cyclic permutations of length n that avoid the pattern 132 (equivalently, 213).
3
1, 1, 2, 4, 10, 24, 68, 182, 544, 1574, 4888, 14864
OFFSET
1,3
LINKS
Miklos Bona, Michael Cory, Cyclic Permutations Avoiding Pairs of Patterns of Length Three, arXiv:1805.05196 [math.CO], 2018.
Brice Huang, An Upper Bound on the Number of (132,213)-Avoiding Cyclic Permutations, arXiv:1808.08462 [math.CO], 2018-2019.
EXAMPLE
For n=3, there are two such permutations, 231 and 312.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Miklos Bona, Aug 05 2019
STATUS
approved