6385920

Appears in sequences

• Triangle T(n,k) = Number of k-cycles on the graph of an n-orthoplex. n>=2, k>=3.at n=29A167986
• Number of (undirected) Hamiltonian cycles in the n-cocktail party graph.at n=5A307923
• 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.at n=21A330662