A322330 Number of 3-colored connected graphs on n labeled nodes up to permutation of the colors.

4, 84, 2470, 108390, 7192444, 726782784, 112795368970, 27132558531330, 10196751602156944, 6022337098348167564, 5612248139616665602510, 8274349264629020203315230, 19333678744046195877906230404, 71675537050405087142116150917624, 421915518251999125756688245906168690

Offset: 3

Author

Andrew Howroyd, Dec 03 2018

Keywords

• nonn

Comments

Equivalently, the number of ways to choose a stable partition of a simple connected graph on n labeled nodes with 3 parts. See A322064 for the definition of stable partition.

Links

• Andrew Howroyd, Table of n, a(n) for n = 3..50

Crossrefs

Column k=3 of A322278.

Cf. A058873 (not necessarily connected), A322064.

Cf. A001832, A322331.

Programs

PARI

\\ See A322278 for M.
{ my(N=20); M(N,3)[3..N, 3]~ }