A097998 Number of connected outerplanar graphs on n labeled nodes.

1, 1, 1, 4, 37, 602, 14436, 458062, 18029992, 845360028, 45938606320, 2836966508216, 196156795008384, 15008752290350656, 1258841795197091392, 114838947237881287800, 11319937495659268412416, 1198945386491423345685968, 135784713567893046210563328

Offset: 0

Author

Steven Finch, Sep 08 2004

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 0..200
• M. Bodirsky and M. Kang, The asymptotic number of outerplanar graphs.
• S. R. Finch, Planar graph growth constants.
• Steven R. Finch, Planar graph growth constants [Cached copy, with permission of the author]

Crossrefs

Cf. A097999, A098000, A111563.

Programs

PARI

seq(n)={Vec(serlaplace(1 + intformal(serreverse(x/exp((1 + 5*x - sqrt(1 - 6*x + x^2 + O(x^n)))/8))/x)))} \\ Andrew Howroyd, Feb 12 2021

Formula

Recurrence known, see Bodirsky and Kang.

Extensions

a(0)=1 prepended and terms a(17) and beyond from Andrew Howroyd, Feb 12 2021