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”).
editing
approved
Definition clarified by Andrew Howroyd, Feb 04 2024
approved
editing
editing
approved
Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four colors up to permutation of the colors.
Definition clarified by Andrew Howroyd, Feb 04 2024
approved
editing
Marko Riedel, <a href="/A233748/b233748_1.txt">Table of n, a(n) for n = 2..40</a>
editing
approved
Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four interchangeable colors under the symmetries of the full edge up to permutation groupof the colors.
proposed
editing
editing
proposed
Number of graphs colorings of the edges of the complete graph on n unlabeled vertices with edges colored with using at most four interchangeable colors under the symmetries of the full edge permutation group.
proposed
editing
editing
proposed