300160

Appears in sequences

• Number of degree-n permutations with (mutually) relatively prime cycle lengths.at n=8A079128
• Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.at n=64A144161
• Number T(n,k) of permutations of [n] such that k is the GCD of the cycle lengths; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A346085