259105

Appears in sequences

• Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.at n=51A054548
• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives numbers belonging to cycles, including fixed points.at n=18A165056
• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives numbers belonging to cycles of length greater than 1.at n=12A165058
• Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).at n=35A276639