login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A263914
Number of (not necessarily connected) simple bridgeless graphs with n nodes.
4
1, 1, 2, 5, 16, 77, 582, 8002, 205538, 10010657, 912838330, 154634281045, 48597689465264, 28412286324844316, 31024936551325074359, 63533058735488301141874, 244916078109873267213212830, 1783406527132994841804241539063, 24605674622456537969150523621546114
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Bridgeless Graph
Eric Weisstein's World of Mathematics, Simple Graph
FORMULA
a(n) = A000088(n) - A263915(n).
Euler transform of A007146. - Falk Hüffner, Jan 18 2016
CROSSREFS
Cf. A000088 (number of simple graphs).
Cf. A007146 (number of simple connected bridgeless graphs).
Cf. A052446 (number of simple connected bridged graphs).
Cf. A263915 (number of simple bridged graphs).
Sequence in context: A377569 A121396 A371829 * A218168 A054960 A004110
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Oct 29 2015
EXTENSIONS
More terms from A007146 by Falk Hüffner, Jan 18 2016
STATUS
approved