login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET
4,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. R. S. Walsh, 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: A123537 A220503 A054597 * A054853 A257947 A245929
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)