A387227 Number of Hamiltonian cycles in the n-Sierpinski tetrahedron graph.

3, 48, 1165688832, 2104020352700472395232386541930940465152

Offset: 1

Author

Eric W. Weisstein, Aug 23 2025

Keywords

• nonn
• hard
• new

Comments

a(3) from Table 1 in Knuth.

Links

• Pontus von Brömssen, Table of n, a(n) for n = 1..5
• Donald E. Knuth, "Hamiltonian Paths and Cycles." Volume 4, Pre-Fascicle 8A in The Art of Computer Programming. Draft. Aug. 19, 2025.
• Eric Weisstein's World of Mathematics, Hamiltonian Cycle.
• Eric Weisstein's World of Mathematics, Sierpinski Tetrahedron Graph.

Crossrefs

Cf. A246959.

Extensions

a(4)-a(5) from Pontus von Brömssen, Aug 24 2025