A013925 - OEIS

%I #19 Feb 26 2024 01:21:30

%S 60,1920,75600,4663680,469336896,79132032000,23121510192000,

%T 12082931084928000,11564306171310537216,20625639730671895535616,

%U 69501783433272242637312000,447403458171641201324598067200,5550030610876067133522251137105920

%N Number of labeled connected graphs with n nodes and 3 cutpoints.

%C Selkow paper has typographical error a(9) = 469336898. - _Sean A. Irvine_, Aug 29 2018

%H Andrew Howroyd, <a href="/A013925/b013925.txt">Table of n, a(n) for n = 5..50</a>

%H S. Selkow, <a href="https://doi.org/10.1016/S0012-365X(97)00170-2">The enumeration of labeled graphs by number of cutpoints</a>, Discr. Math. 185 (1998), 183-191.

%Y Column k=3 of A370064.

%K nonn

%O 5,1

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

%E a(9) corrected and more terms from _Sean A. Irvine_, Aug 29 2018