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 A052442 #42 Feb 16 2025 08:32:42
%S A052442 0,1,1,3,11,56,385,3994,67014,1973029,105731474,10439496931,
%T A052442 1902968718515,641662974453892,401490336727861176,
%U A052442 467924684115578671326,1019752390010650509117288,4171131179469162937375841939,32134378048921787829834095722663,467778894124037894839737804918978194
%N A052442 Number of simple unlabeled n-node graphs of connectivity 1.
%H A052442 Jean-François Alcover, <a href="/A052442/b052442.txt">Table of n, a(n) for n = 1..26</a>
%H A052442 Jens M. Schmidt, <a href="/A324088/a324088.html">Data files in graph6 format</a>
%H A052442 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-ConnectedGraph.html">k-Connected Graph.</a>
%H A052442 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BiconnectedGraph.html">Biconnected Graph</a>
%F A052442 a(n) = A001349(n) - A002218(n) for n > 2. - _Andrew Howroyd_, Sep 04 2019
%t A052442 A001349 = Cases[Import["https://oeis.org/A001349/b001349.txt", "Table"], {_, _}][[All, 2]];
%t A052442 A002218 = Cases[Import["https://oeis.org/A002218/b002218.txt", "Table"], {_, _}][[All, 2]];
%t A052442 a[1] = 0; a[2] = 1;
%t A052442 a[n_] := A001349[[n+1]] - A002218[[n]];
%t A052442 Array[a, 26] (* _Jean-François Alcover_, Sep 10 2019, after _Andrew Howroyd_ *)
%Y A052442 Column k=1 of A259862.
%Y A052442 Cf. A000719, A052443, A052444, A052445.
%K A052442 nonn
%O A052442 1,4
%A A052442 _Eric W. Weisstein_
%E A052442 Terms a(8)-a(11) by _Jens M. Schmidt_, Feb 18 2019
%E A052442 a(1)-a(2) corrected by _Andrew Howroyd_, Aug 28 2019
%E A052442 a(12)-a(20) from _Andrew Howroyd_, Sep 04 2019