|
Search: id:A006202
|
|
|
| A006202 |
|
Number of 4-colored labeled graphs on n nodes.
(Formerly M5356)
|
|
+0
6
|
|
| 0, 0, 0, 1, 80, 7040, 878080, 169967616, 53247344640, 27580935700480, 23884321532149760, 34771166607668412416, 85316631064301031915520, 353171748158258855521812480, 2467057266045387831319241687040, 29078599995993904385498084987109376
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 18, col. 4 of Table 1.5.1 (divided by 64).
R. C. Read, The number of k-colored graphs on labeled nodes, Canad. J. Math., 12 (1960), 410-414.
R. C. Read, personal communication.
|
|
CROSSREFS
|
Cf. A000683. A diagonal of A058843.
Sequence in context: A017743 A004390 A076004 this_sequence A116252 A091754 A118493
Adjacent sequences: A006199 A006200 A006201 this_sequence A006203 A006204 A006205
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
