A230367 Number of colorings of the edges of the complete graph on n unlabeled vertices using at most three interchangeable colors under the symmetries of the full edge permutation group.
1, 3, 15, 142, 4300, 384199, 98654374, 70130880569, 136638863494089, 730439999032117301, 10764688922047900738650, 439762062635963206090747374, 50066701349010686289507943943535, 15962815411172611585301863116082363362, 14314975828662356561039590680011420432741442, 36247244119877673111912410070361564495415461430358
Offset: 2
Keywords
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.