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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Dec 28 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 02:07 EDT 2024. Contains 372020 sequences. (Running on oeis4.)