login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005336
Number of labeled nonseparable (or 2-connected) bipartite graphs with 2n nodes.
(Formerly M3178)
2
1, 3, 355, 297619, 1120452771, 15350524923547, 738416821509929731, 126430202628042630866787, 78847417416749666369637926851, 183373380693566591129149674727445419, 1623847327688450079238401833083018045926051, 55669578575421273854874611540671620662810228887603
OFFSET
1,2
COMMENTS
Nonseparable graphs are also called blocks.
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
F. Harary and R. W. Robinson, Labeled bipartite blocks, Canad. J. Math., 31 (1979), 60-68.
CROSSREFS
Bisection of A004100.
Cf. A005334, A005335 (each part with n nodes).
Sequence in context: A037302 A341229 A157591 * A062226 A266454 A288948
KEYWORD
nonn
EXTENSIONS
Name clarified and more terms added by Andrew Howroyd, Jan 03 2021
STATUS
approved