login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111757 Number of bipartite 2-connected outerplanar graphs on n unlabeled nodes. 0
0, 1, 0, 1, 0, 2, 0, 4, 0, 13, 0, 48, 0, 238, 0, 1325, 0, 8297, 0, 54519 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

Also the number of bipartite (unlabeled) dissections of a polygon.

LINKS

Table of n, a(n) for n=1..20.

M. Bordirsky, É. Fusy, M. Kang and S. Vigerske, Enumeration of Unlabeled Outerplanar Graphs, 2005

S. Vigerske, Asymptotic enumeration of unlabeled outerplanar graphs, Diploma thesis, Humboldt University Berlin, 2005

S. Vigerske, Homepage

FORMULA

Generating function and cycle index sum known, see Vigerske.

CROSSREFS

Cf. A001004.

Sequence in context: A137449 A056946 A225740 * A286122 A286776 A265829

Adjacent sequences:  A111754 A111755 A111756 * A111758 A111759 A111760

KEYWORD

nonn

AUTHOR

Stefan Vigerske, Nov 21 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 13:26 EST 2019. Contains 329751 sequences. (Running on oeis4.)