|
Search: id:A060533
|
|
|
| A060533 |
|
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 3 labeled nodes. |
|
+0
11
|
|
| 1, 3, 0, 3, 9, 12, 19, 27, 36, 46, 57, 69, 82, 96, 111, 127, 144, 162, 181, 201, 222, 244, 267, 291, 316, 342, 369, 397, 426, 456, 487, 519, 552, 586, 621, 657, 694, 732, 771, 811, 852
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983.
|
|
LINKS
|
Vladeta Jovovic, Generating functions for homeomorphically irreducible multigraphs on n labeled nodes
|
|
FORMULA
|
G.f.: (3*x^7 - 7*x^6 + 6*x^5 + 3*x^4 - 11*x^3 + 6*x^2 - 1)/(x - 1)^3. E.g.f. for homeomorphically irreducible multigraphs with n nodes and k edges is (1 + x*y)^( - 1/2)*exp(x*y/2 + x^2*y^2/4)*Sum_{k >= 0} 1/(1 - x)^binomial(k, 2)*exp( - x^2*y*k^2/(2*(1 + x*y)) - x^2*y*k/2)*y^k/k!.
|
|
CROSSREFS
|
Cf. A003514, A060516, A060534-A060537.
Adjacent sequences: A060530 A060531 A060532 this_sequence A060534 A060535 A060536
Sequence in context: A117078 A021333 A104141 this_sequence A128252 A033596 A063529
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 01 2001
|
|
|
Search completed in 0.002 seconds
|
