Number of connected graphs on n labeled nodes, each node being colored with one of 5 colors, such that no edge joins nodes of the same color.

A002030

Number of connected graphs on n labeled nodes, each node being colored with one of 5 colors, such that no edge joins nodes of the same color.

Terms

    a(0) =1a(1) =5a(2) =20a(3) =300a(4) =9980a(5) =616260a(6) =65814020a(7) =11878194300

External references