|
| |
|
|
A005643
|
|
Number of labeled irreducible 2-connected graphs with n edges.
(Formerly M5191)
|
|
1
| |
|
|
1, 26, 1858, 236856, 53458832, 21494404400, 15580475076986, 20666605559464968, 50987322515860980236, 237747564913232367202656, 2125708395579372100915553094
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 4,2
|
|
|
REFERENCES
| N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Walsh, T. R. S.; Counting labeled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11.
|
|
|
CROSSREFS
| Cf. A054597.
Sequence in context: A005644 A123537 A054597 * A054853 A206390 A173949
Adjacent sequences: A005640 A005641 A005642 * A005644 A005645 A005646
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
