[go: up one dir, main page]

login
A346661 revision #18

A346661
Number of cyclic patterns of length n that avoid the vincular pattern 23-4-1.
1
1, 1, 2, 5, 15, 50, 180, 690, 2792, 11857, 52633, 243455, 1170525, 5837934, 30151474, 161021581, 888001485, 5051014786, 29600662480, 178541105770, 1107321666920, 7055339825171, 46142654894331, 309513540865544, 2127744119042216, 14979904453920111, 107932371558460341, 795363217306369817, 5990768203554158167, 46094392105916344968, 362092868720288824992
OFFSET
0,3
COMMENTS
The vincular pattern 23-4-1 requires the 2 and the 3 to be adjacent.
By the trivial Wilf equivalence obtained by reversing the permutations, a(n) is also the number of cyclic patterns of length n that avoid the vincular pattern 32-1-4.
LINKS
Rupert Li, Vincular Pattern Avoidance on Cyclic Permutations, arXiv:2107.12353 [math.CO], 2021.
Toufik Mansour and Mark Shattuck, Enumerating circular permutations avoiding the vincular pattern 23 4 1, arXiv:2111.04211 [math.CO], 2021.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Rupert Li, Aug 03 2021
EXTENSIONS
More terms from Vaclav Kotesovec, Nov 09 2021, computed by Toufik Mansour and Mark Shattuck
STATUS
editing