Bóna, Miklós; Homberger, Cheyne; Pantone, Jay; Vatter, Vincent Pattern-avoiding involutions: exact and asymptotic enumeration. (English) Zbl 1333.05018 Australas. J. Comb. 64, Part 1, 88-119 (2016). Summary: We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. We directly enumerate the involutions avoiding 1342 and the involutions avoiding 2341. As we demonstrate, the numerical data for these problems exhibits some surprising behavior. This strange behavior even provides some very unexpected data related to the number of 1324-avoiding permutations. Cited in 1 ReviewCited in 7 Documents MSC: 05A15 Exact enumeration problems, generating functions 05A16 Asymptotic enumeration Software:OEIS; PermLab PDFBibTeX XMLCite \textit{M. Bóna} et al., Australas. J. Comb. 64, Part 1, 88--119 (2016; Zbl 1333.05018) Full Text: arXiv Link Online Encyclopedia of Integer Sequences: The number of 123-avoiding simple involutions of length n.