This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A263915 #24 Feb 16 2025 08:33:27 %S A263915 0,1,2,6,18,79,462,4344,69130,1994511,106159534,10456891547, %T A263915 1904341902688,641869332391172,401549418479234409, %U A263915 467956969039256753054,1019786043659665470506946,4171198012616858743636651785,32134630668466555232483869886654 %N A263915 Number of (not necessarily connected) simple bridged graphs with n nodes. %H A263915 Andrew Howroyd, <a href="/A263915/b263915.txt">Table of n, a(n) for n = 1..30</a> %H A263915 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BridgedGraph.html">Bridged Graph</a> %H A263915 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a> %F A263915 a(n) = A000088(n) - A263914(n). %Y A263915 Cf. A000088 (number of simple graphs). %Y A263915 Cf. A007146 (number of simple connected bridgeless graphs). %Y A263915 Cf. A052446 (number of simple connected bridged graphs). %Y A263915 Cf. A263914 (number of simple bridgeless graph). %K A263915 nonn %O A263915 1,3 %A A263915 _Eric W. Weisstein_, Oct 29 2015 %E A263915 More terms using formula by _Falk Hüffner_, Jan 18 2016