A013923 Number of labeled connected graphs with n vertices and 1 cutpoint.

3, 16, 250, 8496, 540568, 61672192, 12608406288, 4697459302400, 3256012245850496, 4276437400678311936, 10796431791679078528256, 52955364458428847588956160, 508511231062550463852707804160, 9611398894866376672902234634977280

Offset

3,1

Links

Andrew Howroyd, Table of n, a(n) for n = 3..50

S. Selkow, The enumeration of labeled graphs by number of cutpoints, Discr. Math. 185 (1998), 183-191.

Formula

E.g.f.: x * (exp(B'(x)) - B'(x) - 1) where B(x) is the e.g.f. for A013922. - Sean A. Irvine, Aug 28 2018

Crossrefs

Column k=1 of A370064.

Sequence in context: A071897 A182012 A272385 * A053466 A005031 A300960

Adjacent sequences: A013920 A013921 A013922 * A013924 A013925 A013926

Keyword

nonn

Author

Stanley Selkow (sms(AT)owl.WPI.EDU)

Extensions

More terms from Sean A. Irvine, Aug 28 2018

Status

approved