A233894 Number of colorings of the edges of the complete graph on n unlabeled vertices using at most five interchangeable colors under the symmetries of the full edge permutation group.

1, 3, 24, 956, 370438, 794610689, 7713545142724, 334331083961076765, 65276369289196100770910, 57946272822007395195661933018, 235778940244496842474046899073666629, 4427916979407079482171816367439500693634123, 386083248154389925434229068715450099160359622470252

Offset: 2

Author

Marko Riedel, Dec 20 2013

Keywords

• nonn

References

• Harary and Palmer, Graphical Enumeration, Chapter Six.

Links

• Marko Riedel, Table of n, a(n) for n = 2..40
• Marko Riedel, Colorings of the cube.
• Marko Riedel, Colorings of the complete graph Kn with some number of swappable colors.

Crossrefs

Cf. A007869.

Extensions

More terms from Marko Riedel Feb 04 2024