726782784

Appears in sequences

• Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.at n=30A322278
• Number of 3-colored connected graphs on n labeled nodes up to permutation of the colors.at n=5A322330