2010328

Appears in sequences

• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.at n=47A084269
• Triangle read by rows: T(n,k) (n>=2, k=2..n) gives number of connected graphs on n nodes with chromatic number n-k+1.at n=43A126736
• Number of connected graphs on n nodes with chromatic number 3.at n=9A126737