A233748 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

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