login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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