This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A013923 #17 Feb 26 2024 01:21:46 %S A013923 3,16,250,8496,540568,61672192,12608406288,4697459302400, %T A013923 3256012245850496,4276437400678311936,10796431791679078528256, %U A013923 52955364458428847588956160,508511231062550463852707804160,9611398894866376672902234634977280 %N A013923 Number of labeled connected graphs with n vertices and 1 cutpoint. %H A013923 Andrew Howroyd, <a href="/A013923/b013923.txt">Table of n, a(n) for n = 3..50</a> %H A013923 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. %F A013923 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 %Y A013923 Column k=1 of A370064. %K A013923 nonn %O A013923 3,1 %A A013923 Stanley Selkow (sms(AT)owl.WPI.EDU) %E A013923 More terms from _Sean A. Irvine_, Aug 28 2018