1206915

Appears in sequences

• Number of simple labeled graphs with (at most) 3-colored nodes such that no edge connects two nodes of the same color.at n=6A191371
• Array read by antidiagonals: T(n,k) is the number of graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.at n=51A322280