A286743 - OEIS

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

A286743

Number of (not necessarily connected) simple cyclic graphs on n vertices.

0, 0, 1, 5, 24, 136, 1007, 12270, 274515, 12004839, 1018997154, 165091170991, 50502031364294, 29054155657226889, 31426485969804288254, 64001015704527557845023, 245935864153532932683596813, 1787577725145611700547877883649, 24637809253125004524383007490657239

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

Table of n, a(n) for n=1..19.

Eric Weisstein's World of Mathematics, Cyclic Graph

FORMULA

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

CROSSREFS

Cf. A000088 (number of simple graphs on n vertices).

Cf. A005195 (number of forests with n unlabeled nodes).

Cf. A241841 (number of simple connected graphs on n nodes that are not trees, i.e., number of connected cyclic graphs).