9030799218

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=31A322278
• Number of 4-colored connected graphs on n labeled nodes up to permutation of the colors.at n=4A322331