87114

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=59A126732
• Number of connected graphs on n nodes with edge chromatic number 4.at n=9A126734
• Numbers k for which A064380(k) = k/2.at n=19A185078
• Numbers k such that iphi(k) divides k, where iphi is the infinitary Euler phi function (A064380).at n=20A373057