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 A038095 #13 Nov 23 2020 20:57:11
%S A038095 6,72,1440,49680,2998800,324237312,64440883584,24059497893120,
%T A038095 17143668999705600,23569875858252303360,63000019679242001900544,
%U A038095 329150325651711743768150016,3374625529825460904919664793600,68094821953233373962606732799672320
%N A038095 Number of rooted connected graphs on n labeled nodes where the root has degree 2.
%H A038095 Andrew Howroyd, <a href="/A038095/b038095.txt">Table of n, a(n) for n = 3..50</a>
%F A038095 E.g.f.: B(x)/C(x) where B, C resp E.g.f.'s of A038094 and A006125.
%o A038095 (PARI) seq(n)={Vec(serlaplace(sum(k=1, n, k*binomial(k-1, 2)*2^binomial(k-1, 2)*x^k/k!)/sum(k=0, n, 2^binomial(k, 2)*x^k/k!) + O(x*x^n)))} \\ _Andrew Howroyd_, Nov 23 2020
%Y A038095 Cf. A038094, A038096, A038097.
%K A038095 nonn,easy
%O A038095 3,1
%A A038095 _Christian G. Bower_, Jan 04 1999; suggested by Vlady Ravelomanana
%E A038095 Terms a(12) and beyond corrected by _Andrew Howroyd_, Nov 23 2020