A324670 - OEIS

%I #20 Sep 04 2019 17:20:21

%S 0,0,1,2,8,43,360,4869,113622,4605833,325817259,40350371693,

%T 8825083057727,3447229161054412,2432897732375453872,

%U 3135299553791882831175,7445569254636418368355175,32831169277561326131677454356,270499962116368309216399255404116

%N Number of simple graphs on n unlabeled nodes with minimum degree exactly 2.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimumVertexDegree.html">Minimum Vertex Degree</a>

%F a(n) = A261919(n) - A007111(n).

%Y Column k=2 of A294217.

%Y A diagonal of A263293.

%Y Cf. A005637, A007111, A261919.

%K nonn

%O 1,4

%A _Andrew Howroyd_, Sep 03 2019