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 A380127 #18 May 25 2025 20:42:48 %S A380127 0,0,0,0,1,4,29,424,15471,1249972,187095836,48211095992, %T A380127 21124789189703,15899588477573380,20900616544566305160, %U A380127 48843531771541430977365,206305644374013971584957120,1597725697294349735784472597650,22957145992821363656862872542094876,617791721556546579087246090934406095676 %N A380127 Number of connected unlabeled graphs with n nodes and minimum vertex degree >= 4. %C A380127 First differs from A324227(n) at n = 10. %H A380127 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedGraph.html">Connected Graph</a>. %H A380127 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumVertexDegree.html">Minimum Vertex Degree</a>. %o A380127 (nauty) geng $n -d4 -c -u # see nauty documentation, _Georg Grasegger_, Mar 20 2025 %Y A380127 Cf. A007112 (connected graphs with degree >= 3). %Y A380127 Cf. A324227 (4-edge-connected graphs). %K A380127 nonn %O A380127 1,6 %A A380127 _Eric W. Weisstein_, Mar 11 2025 %E A380127 a(11)-a(12) added by _Georg Grasegger_, Mar 20 2025 %E A380127 a(13) onwards from _Andrew Howroyd_, May 25 2025