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.

A263915 Number of (not necessarily connected) simple bridged graphs with n nodes.

Original entry on oeis.org

0, 1, 2, 6, 18, 79, 462, 4344, 69130, 1994511, 106159534, 10456891547, 1904341902688, 641869332391172, 401549418479234409, 467956969039256753054, 1019786043659665470506946, 4171198012616858743636651785, 32134630668466555232483869886654
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. A263914 (number of simple bridgeless graph).

Formula

a(n) = A000088(n) - A263914(n).

Extensions

More terms using formula by Falk Hüffner, Jan 18 2016