[go: up one dir, main page]

login
Number of (not necessarily connected) simple bridgeless graphs with n nodes.
4

%I #21 Jan 01 2021 14:21:49

%S 1,1,2,5,16,77,582,8002,205538,10010657,912838330,154634281045,

%T 48597689465264,28412286324844316,31024936551325074359,

%U 63533058735488301141874,244916078109873267213212830,1783406527132994841804241539063,24605674622456537969150523621546114

%N Number of (not necessarily connected) simple bridgeless graphs with n nodes.

%H Andrew Howroyd, <a href="/A263914/b263914.txt">Table of n, a(n) for n = 1..30</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BridgelessGraph.html">Bridgeless Graph</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>

%F a(n) = A000088(n) - A263915(n).

%F Euler transform of A007146. - _Falk Hüffner_, Jan 18 2016

%Y Cf. A000088 (number of simple graphs).

%Y Cf. A007146 (number of simple connected bridgeless graphs).

%Y Cf. A052446 (number of simple connected bridged graphs).

%Y Cf. A263915 (number of simple bridged graphs).

%K nonn

%O 1,3

%A _Eric W. Weisstein_, Oct 29 2015

%E More terms from A007146 by _Falk Hüffner_, Jan 18 2016