A234601 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A234601

Total counts of distinct (undirected) cycles for all simple graphs of order n.

2

0, 0, 1, 13, 143, 1994, 39688, 1484397, 117971920, 21365826986

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

OFFSET

1,4

LINKS

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

Eric Weisstein's World of Mathematics, Graph Cycle

CROSSREFS

Cf. A124964 (total numbers of directed Hamiltonian cycles for simple graphs on n nodes).

Cf. A193352 (total numbers of directed Hamiltonian paths for simple graphs on n nodes).

Sequence in context: A029483 A266806 A015672 * A164825 A098298 A045725

Adjacent sequences: A234598 A234599 A234600 * A234602 A234603 A234604

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Dec 28 2013

STATUS

approved