This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322330 #10 May 18 2020 03:01:42
%S A322330 4,84,2470,108390,7192444,726782784,112795368970,27132558531330,
%T A322330 10196751602156944,6022337098348167564,5612248139616665602510,
%U A322330 8274349264629020203315230,19333678744046195877906230404,71675537050405087142116150917624,421915518251999125756688245906168690
%N A322330 Number of 3-colored connected graphs on n labeled nodes up to permutation of the colors.
%C A322330 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 A322330 Andrew Howroyd, <a href="/A322330/b322330.txt">Table of n, a(n) for n = 3..50</a>
%o A322330 (PARI) \\ See A322278 for M.
%o A322330 { my(N=20); M(N,3)[3..N, 3]~ }
%Y A322330 Column k=3 of A322278.
%Y A322330 Cf. A058873 (not necessarily connected), A322064.
%Y A322330 Cf. A001832, A322331.
%K A322330 nonn
%O A322330 3,1
%A A322330 _Andrew Howroyd_, Dec 03 2018