|
%I #9 May 18 2020 03:01:51
%S 38,3140,307390,42747460,9030799218,3012940879620,1628920258500230,
%T 1451200592494754420,2152262350514389189978,5344908165470797467243700,
%U 22297912999366719508496874990,156537595118740106754291705258180,1850935702258755131781978373277937218
%N Number of 4-colored connected graphs on n labeled nodes up to permutation of the colors.
%C 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.
%H Andrew Howroyd, <a href="/A322331/b322331.txt">Table of n, a(n) for n = 4..50</a>
%o (PARI) \\ See A322278 for M.
%o { my(N=20); M(N,4)[4..N, 4]~ }
%Y Column k=4 of A322278.
%Y Cf. A058873 (not necessarily connected), A322064.
%Y Cf. A001832, A322330.
%K nonn
%O 4,1
%A _Andrew Howroyd_, Dec 03 2018
| 