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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057865 Number of simple Hamilton-connected graphs on n nodes. 0
1, 1, 1, 1, 3, 13, 116, 2009, 72529, 4784340, 554271698 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

Eric Weisstein's World of Mathematics, Hamilton-Connected Graph.

CROSSREFS

Sequence in context: A119723 A093011 A262147 * A344210 A260847 A121921

Adjacent sequences: A057862 A057863 A057864 * A057866 A057867 A057868

KEYWORD

nonn,hard,more

AUTHOR

Eric W. Weisstein, May 16 2003

EXTENSIONS

a(8)-a(10) from Gordon F. Royle, Mar 22 2006

a(11) from Sean A. Irvine, Jul 10 2022

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 December 1 21:09 EST 2022. Contains 358484 sequences. (Running on oeis4.)