The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #29 Sep 14 2021 04:50:19
%S 1,1,2,4,10,24,66,178,512,1486,4446,13468
%N Number of cyclic permutations of length n avoiding the pattern 321.
%C Comment from _F. Chapoton_, Sep 14 2021: (Start)
%C The maps sending a permutation to its inverse or to its reverse-complement define two commuting involutions on these sets of permutations.
%C The next terms in the sequence could be 41648, 130178, though these are counting Dyck words such that an associated permutation is cyclic, related but not obviously equivalent combinatorial objects. (End)
%H Miklos Bona and Michael Cory, <a href="http://arxiv.org/abs/1805.05196">Cyclic Permutations Avoiding Pairs of Patterns of Length Three</a>, arXiv:1805.05196 [math.CO], 2018.
%e For n=3, there are two such permutations, 231 and 312.
%Y Cf. A000957, A309504, A309505, A309506.
%K nonn,more
%O 1,3
%A _Miklos Bona_, Aug 05 2019