A052263 - 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

A052263

Number of 5-colored labeled graphs on n nodes(divided by 1024).

0, 0, 0, 0, 1, 240, 62720, 23224320, 13440516096, 12754259804160, 20377681883299840, 55671587500342640640, 262483693581093123915776, 2147534811240814766425374720, 30585643102219392981931508367360

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,6

LINKS

Table of n, a(n) for n=1..15.

R. C. Read, The number of k-colored graphs on labelled nodes, Canad. J. Math., 12 (1960), 410—414.

FORMULA

a(n, k) = (1/k)*Sum_{r=1..n-1} C(n, r) 2^(r*(n-r)) a(r, k-1).

CROSSREFS

Cf. A000683, A006201, A006202.

Sequence in context: A232843 A289636 A001943 * A218514 A270054 A213696

Adjacent sequences: A052260 A052261 A052262 * A052264 A052265 A052266

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Feb 03 2000

STATUS

approved