Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 May 18 2020 03:01:42
%S 4,84,2470,108390,7192444,726782784,112795368970,27132558531330,
%T 10196751602156944,6022337098348167564,5612248139616665602510,
%U 8274349264629020203315230,19333678744046195877906230404,71675537050405087142116150917624,421915518251999125756688245906168690
%N Number of 3-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 3 parts. See A322064 for the definition of stable partition.
%H Andrew Howroyd, <a href="/A322330/b322330.txt">Table of n, a(n) for n = 3..50</a>
%o (PARI) \\ See A322278 for M.
%o { my(N=20); M(N,3)[3..N, 3]~ }
%Y Column k=3 of A322278.
%Y Cf. A058873 (not necessarily connected), A322064.
%Y Cf. A001832, A322331.
%K nonn
%O 3,1
%A _Andrew Howroyd_, Dec 03 2018