login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301559 Number of (undirected) Hamiltonian paths in the n-odd graph. 0
0, 3, 120, 328345920 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Eric Weisstein's World of Mathematics, Hamiltonian Path

Eric Weisstein's World of Mathematics, Odd Graph

FORMULA

a(n) = A233826(n)/2.

CROSSREFS

Cf. A233826 (directed Hamiltonian paths).

Sequence in context: A246292 A202768 A289986 * A141440 A156001 A229633

Adjacent sequences:  A301556 A301557 A301558 * A301560 A301561 A301562

KEYWORD

nonn,more,hard

AUTHOR

Eric W. Weisstein, Mar 23 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 04:46 EST 2020. Contains 332063 sequences. (Running on oeis4.)