A233748 Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four colors up to permutation of the colors.

1, 3, 22, 513, 67685, 37205801, 74992370359, 543437207831908, 14224090440652751128, 1355263603548588163939892, 473629305416562052216063601182, 611217587951920565260750675133929534, 2929826971690847578421964010597063713803102, 52431093582529289457516130655642218612938867242516

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: A156512 A119770 A272659 * A153230 A195462 A276749

Adjacent sequences: A233745 A233746 A233747 * A233749 A233750 A233751

Keyword

nonn

Author

Marko Riedel, Dec 20 2013

Extensions

Definition clarified by Andrew Howroyd, Feb 04 2024

Status

approved