A389387 Number of not necessarily connected simple bridgeless graphs on n labeled nodes.

1, 1, 1, 2, 15, 314, 13667, 1137508, 177932721, 52580593180, 29698558800457, 32445534047053368, 69254488122077282527, 291053230023059379821048, 2421829642609221425122681435, 40050219583039622219881137995312, 1319550586975722078862525627438801185, 86751977978204119861885151668177632763920

Offset

0,4

Links

Pontus von Brömssen, Table of n, a(n) for n = 0..82

Eric Weisstein's World of Mathematics, Bridgeless Graph.

Formula

E.g.f.: exp(g(x)+x), where g(x) is the e.g.f. for A095983.

Crossrefs

Cf. A095983, A263914 (unlabeled version).

Sequence in context: A304120 A255929 A381988 * A059167 A003025 A015200

Adjacent sequences: A389384 A389385 A389386 * A389388 A389389 A389390

Keyword

nonn

Author

Pontus von Brömssen, Oct 07 2025

Status

approved