The $O(1/n^{85})$ Asymptotic expansion of OEIS sequence A85

Shalosh B. Ekhad, Manuel Kauers, Doron Zeilberger

Published 2024-10-19Version 1

One of the most important sequences in enumerative combinatorics is OEIS sequence A85, the number of involutions of length n. In the Art of Computer Programming, vol. 3, Don Knuth derived the O(1/n) asymptotic formula for these numbers. In this modest tribute to our two heroes, Neil Sloane who just turned 85, and Don Knuth who was 85 a year ago, we go all the way to an $O(1/n^{85})$ asymptotic formula.