Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four colors up to permutation of the colors.

A233748

Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four colors up to permutation of the colors.

Terms

    a(0) =1a(1) =3a(2) =22a(3) =513a(4) =67685a(5) =37205801a(6) =74992370359

External references