1015440domain: NAppears in sequencesNumber of Eulerian circuits on the complete graph K_{2n+1}, divided by (n-1)!^(2n+1).at n=2A007082Triangular array read by rows. T(n,k) is the number of labeled transitive relations on [n] that have exactly k symmetric points.at n=23A355783