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 A230367 #28 Feb 04 2024 22:29:56 %S A230367 1,3,15,142,4300,384199,98654374,70130880569,136638863494089, %T A230367 730439999032117301,10764688922047900738650, %U A230367 439762062635963206090747374,50066701349010686289507943943535,15962815411172611585301863116082363362,14314975828662356561039590680011420432741442,36247244119877673111912410070361564495415461430358 %N 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. %D A230367 Harary and Palmer, Graphical Enumeration, Chapter Six. %H A230367 Marko Riedel, <a href="/A230367/b230367.txt">Table of n, a(n) for n = 2..40</a> %H A230367 Marko Riedel, <a href="http://math.stackexchange.com/questions/607956/">Colorings of the cube</a>. %H A230367 Marko Riedel, <a href="/A230367/a230367_1.maple.txt">Colorings of the complete graph Kn with some number of swappable colors</a>. %Y A230367 Cf. A007869. %K A230367 nonn %O A230367 2,2 %A A230367 _Marko Riedel_, Dec 20 2013