This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A346661 #27 Nov 19 2023 09:00:15 %S A346661 1,1,2,5,15,50,180,690,2792,11857,52633,243455,1170525,5837934, %T A346661 30151474,161021581,888001485,5051014786,29600662480,178541105770, %U A346661 1107321666920,7055339825171,46142654894331,309513540865544,2127744119042216,14979904453920111,107932371558460341,795363217306369817,5990768203554158167,46094392105916344968,362092868720288824992 %N A346661 Number of cyclic patterns of length n that avoid the vincular pattern 23-4-1. %C A346661 The vincular pattern 23-4-1 requires the 2 and the 3 to be adjacent. %C A346661 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. %H A346661 Rupert Li, <a href="https://arxiv.org/abs/2107.12353">Vincular Pattern Avoidance on Cyclic Permutations</a>, arXiv:2107.12353 [math.CO], 2021. %H A346661 Toufik Mansour and Mark Shattuck, <a href="https://arxiv.org/abs/2111.04211">Enumerating circular permutations avoiding the vincular pattern 23 4 1</a>, arXiv:2111.04211 [math.CO], 2021. %H A346661 Toufik Mansour and Mark Shattuck, <a href="http://ajc.maths.uq.edu.au/pdf/83/ajc_v83_p176.pdf">On a question of Li concerning an uncounted class of circular permutations</a>, The Australasian Journal of Combinatorics, volume 83 part 1, 2022, pp. 176-195. %Y A346661 Cf. A025242, A047970, A346660. %K A346661 nonn %O A346661 0,3 %A A346661 _Rupert Li_, Aug 03 2021 %E A346661 More terms from _Vaclav Kotesovec_, Nov 09 2021, computed by Toufik Mansour and Mark Shattuck