[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.
2
1, 3, 24, 956, 370438, 794610689, 7713545142724, 334331083961076765, 65276369289196100770910, 57946272822007395195661933018, 235778940244496842474046899073666629, 4427916979407079482171816367439500693634123, 386083248154389925434229068715450099160359622470252
(list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
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.
Sequence in context: A301525 A277177 A226053 * A075655 A300551 A000856
Adjacent sequences: A233891 A233892 A233893 * A233895 A233896 A233897
KEYWORD
nonn
AUTHOR
Marko Riedel, Dec 20 2013
EXTENSIONS
More terms from Marko Riedel Feb 04 2024
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 11:12 EST 2024. Contains 377535 sequences.
License Agreements, Terms of Use, Privacy Policy