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

 


A308144
Number of (undirected) Hamiltonian paths on the triangular grid with n vertices on each side.
1
1, 3, 12, 114, 1968, 66312, 4381020, 578266212, 153350225268, 82409298702462, 90180040305841212, 201800030110625440248, 926548406689594565864346, 8752381854153235620928637604
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Hamiltonian Path
Eric Weisstein's World of Mathematics, Triangular Grid Graph
FORMULA
a(n) = A112675(n)/2 for n > 1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, May 14 2019
EXTENSIONS
a(1) corrected by Andrew Howroyd, Jan 19 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 21 19:14 EDT 2024. Contains 376087 sequences. (Running on oeis4.)