84211200

Appears in sequences

• Number of (undirected) Hamiltonian paths in the n-cocktail party graph.at n=5A307935
• Triangle read by rows: T(n,k) is the number of polygons with 2*n sides, of which k run through the center of a circle, on the circumference of which the 2*n vertices of the polygon are arranged at equal spacing, up to rotation.at n=29A358328