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

38, 3140, 307390, 42747460, 9030799218, 3012940879620, 1628920258500230, 1451200592494754420, 2152262350514389189978, 5344908165470797467243700, 22297912999366719508496874990, 156537595118740106754291705258180, 1850935702258755131781978373277937218

Offset: 4

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 4 parts. See A322064 for the definition of stable partition.

Links

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

Crossrefs

Column k=4 of A322278.

Cf. A058873 (not necessarily connected), A322064.

Cf. A001832, A322330.

Programs

PARI

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