login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
Toufik Mansour and Mark Shattuck, On a question of Li concerning an uncounted class of circular permutations, The Australasian Journal of Combinatorics, volume 83 part 1, 2022, pp. 176-195.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rupert Li, Aug 03 2021
EXTENSIONS
More terms from Vaclav Kotesovec, Nov 09 2021, computed by Toufik Mansour and Mark Shattuck
STATUS
approved