|
Search: id:A052263
|
|
|
| A052263 |
|
Number of 5-colored labeled graphs on n nodes(divided by 1024). |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 240, 62720, 23224320, 13440516096, 12754259804160, 20377681883299840, 55671587500342640640, 262483693581093123915776, 2147534811240814766425374720, 30585643102219392981931508367360
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
REFERENCES
|
R. C. Read, The number of k-colored graphs on labeled 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: A035841 A110163 A001943 this_sequence A035281 A008696 A047806
Adjacent sequences: A052260 A052261 A052262 this_sequence A052264 A052265 A052266
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 03 2000
|
|
|
Search completed in 0.002 seconds
|
