The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263915 Number of (not necessarily connected) simple bridged graphs with n nodes. 4
 0, 1, 2, 6, 18, 79, 462, 4344, 69130, 1994511, 106159534, 10456891547, 1904341902688, 641869332391172, 401549418479234409, 467956969039256753054, 1019786043659665470506946, 4171198012616858743636651785, 32134630668466555232483869886654 (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, Bridged Graph Eric Weisstein's World of Mathematics, Simple Graph FORMULA a(n) = A000088(n) - A263914(n). CROSSREFS Cf. A000088 (number of simple graphs). Cf. A007146 (number of simple connected bridgeless graphs). Cf. A052446 (number of simple connected bridged graphs). Cf. A263914 (number of simple bridgeless graph). Sequence in context: A266858 A141580 A007869 * A360516 A144557 A327729 Adjacent sequences: A263912 A263913 A263914 * A263916 A263917 A263918 KEYWORD nonn AUTHOR Eric W. Weisstein, Oct 29 2015 EXTENSIONS More terms using formula by Falk Hüffner, Jan 18 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 05:28 EDT 2024. Contains 375985 sequences. (Running on oeis4.)