|
%I #32 Feb 05 2024 10:59:36
%S 1,3,24,956,370438,794610689,7713545142724,334331083961076765,
%T 65276369289196100770910,57946272822007395195661933018,
%U 235778940244496842474046899073666629,4427916979407079482171816367439500693634123,386083248154389925434229068715450099160359622470252
%N 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.
%D Harary and Palmer, Graphical Enumeration, Chapter Six.
%H Marko Riedel, <a href="/A233894/b233894.txt">Table of n, a(n) for n = 2..40</a>
%H Marko Riedel, <a href="http://math.stackexchange.com/questions/607956/">Colorings of the cube</a>.
%H Marko Riedel, <a href="/A233894/a233894_1.maple.txt">Colorings of the complete graph Kn with some number of swappable colors</a>.
%Y Cf. A007869.
%K nonn
%O 2,2
%A _Marko Riedel_, Dec 20 2013
%E More terms from _Marko Riedel_ Feb 04 2024
| 