A380127 Number of connected unlabeled graphs with n nodes and minimum vertex degree >= 4.

0, 0, 0, 0, 1, 4, 29, 424, 15471, 1249972, 187095836, 48211095992, 21124789189703, 15899588477573380, 20900616544566305160, 48843531771541430977365, 206305644374013971584957120, 1597725697294349735784472597650, 22957145992821363656862872542094876, 617791721556546579087246090934406095676

Offset

1,6

Comments

First differs from A324227(n) at n = 10.

Links

Table of n, a(n) for n=1..20.

Eric Weisstein's World of Mathematics, Connected Graph.

Eric Weisstein's World of Mathematics, Minimum Vertex Degree.

Prog

(nauty) geng $n -d4 -c -u # see nauty documentation, Georg Grasegger, Mar 20 2025

Crossrefs

Cf. A007112 (connected graphs with degree >= 3).

Cf. A324227 (4-edge-connected graphs).

Sequence in context: A370165 A162287 A324227 * A277357 A173715 A230326

Adjacent sequences: A380124 A380125 A380126 * A380128 A380129 A380130

Keyword

nonn

Author

Eric W. Weisstein, Mar 11 2025

Extensions

a(11)-a(12) added by Georg Grasegger, Mar 20 2025

a(13) onwards from Andrew Howroyd, May 25 2025

Status

approved