1066463

Appears in sequences

• Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.at n=60A126732
• Number of connected graphs on n nodes with edge chromatic number 5.at n=9A126735