Number of simple labeled graphs with (at most) 3-colored nodes such that no edge connects two nodes of the same color.

A191371

Number of simple labeled graphs with (at most) 3-colored nodes such that no edge connects two nodes of the same color.

Terms

    a(0) =1a(1) =3a(2) =15a(3) =123a(4) =1635a(5) =35043a(6) =1206915a(7) =66622083a(8) =5884188675a(9) =830476531203

External references