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!)
A185360 Number of almost Hamiltonian simple graphs on n vertices. 0
0, 0, 1, 1, 7, 28, 257, 2933 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Using the definition that a graph is "almost Hamiltonian" if its Hamiltonian length (length of a Hamiltonian walk) is one greater than the vertex count.

LINKS

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

Eric Weisstein's World of Mathematics, Almost Hamiltonian Graph

Eric Weisstein's World of Mathematics, Hamiltonian Walk

Eric Weisstein's World of Mathematics, Hamiltonian Number

CROSSREFS

Sequence in context: A355155 A058822 A054369 * A198028 A244300 A203209

Adjacent sequences:  A185357 A185358 A185359 * A185361 A185362 A185363

KEYWORD

nonn,more,hard

AUTHOR

Eric W. Weisstein, Aug 29 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 October 4 21:22 EDT 2022. Contains 357240 sequences. (Running on oeis4.)