  We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$
avoiding cyclic permutations. This is the first nontrivial upper bound on the
number of such permutations. We also construct an algorithm to determine
whether a $(132,213)$ avoiding permutation is cyclic that references only the
permutation's layer lengths.
