cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A263914 #22 Feb 16 2025 08:33:27
%S A263914 1,1,2,5,16,77,582,8002,205538,10010657,912838330,154634281045,
%T A263914 48597689465264,28412286324844316,31024936551325074359,
%U A263914 63533058735488301141874,244916078109873267213212830,1783406527132994841804241539063,24605674622456537969150523621546114
%N A263914 Number of (not necessarily connected) simple bridgeless graphs with n nodes.
%H A263914 Andrew Howroyd, <a href="/A263914/b263914.txt">Table of n, a(n) for n = 1..30</a>
%H A263914 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BridgelessGraph.html">Bridgeless Graph</a>
%H A263914 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>
%F A263914 a(n) = A000088(n) - A263915(n).
%F A263914 Euler transform of A007146. - _Falk Hüffner_, Jan 18 2016
%Y A263914 Cf. A000088 (number of simple graphs).
%Y A263914 Cf. A007146 (number of simple connected bridgeless graphs).
%Y A263914 Cf. A052446 (number of simple connected bridged graphs).
%Y A263914 Cf. A263915 (number of simple bridged graphs).
%K A263914 nonn
%O A263914 1,3
%A A263914 _Eric W. Weisstein_, Oct 29 2015
%E A263914 More terms from A007146 by _Falk Hüffner_, Jan 18 2016