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.

Original entry on oeis.org

1, 1, 2, 5, 16, 77, 582, 8002, 205538, 10010657, 912838330, 154634281045, 48597689465264, 28412286324844316, 31024936551325074359, 63533058735488301141874, 244916078109873267213212830, 1783406527132994841804241539063, 24605674622456537969150523621546114
Offset: 1

Views

Author

Eric W. Weisstein, Oct 29 2015

Keywords

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).

Formula

a(n) = A000088(n) - A263915(n).
Euler transform of A007146. - Falk Hüffner, Jan 18 2016

Extensions

More terms from A007146 by Falk Hüffner, Jan 18 2016