[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..30
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: A179500 A121396 A371829 * A218168 A054960 A004110
Adjacent sequences: A263911 A263912 A263913 * A263915 A263916 A263917
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Oct 29 2015
EXTENSIONS
More terms from A007146 by Falk Hüffner, Jan 18 2016
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 4 19:29 EDT 2024. Contains 376520 sequences.
License Agreements, Terms of Use, Privacy Policy