The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A057864 Number of simple traceable graphs on n nodes. 21
1, 1, 2, 5, 18, 91, 734, 10030, 248427, 11482572, 1000231510 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Number of undirected graphs on n nodes possessing a Hamiltonian path (not circuit).
LINKS
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version f0eaa32.
Eric Weisstein's World of Mathematics, Traceable Graph
Wikipedia, Hamiltonian path
FORMULA
A000088(n) = a(n) + A283420(n). - Gus Wiseman, Jun 17 2019
CROSSREFS
Main diagonal of A309524.
The labeled case is A326206.
The directed case is A326221 (with loops).
Unlabeled simple graphs not containing a Hamiltonian path are A283420.
Unlabeled simple graphs containing a Hamiltonian cycle are A003216.
Sequence in context: A227094 A173227 A099556 * A320154 A032273 A143522
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(8) and a(9) from Eric W. Weisstein, Jun 04 2004
a(10) from Eric W. Weisstein, May 27 2009
a(11) added using tinygraph by Falk Hüffner, Jan 19 2016
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 June 17 15:21 EDT 2024. Contains 373453 sequences. (Running on oeis4.)