A358960 Number of directed Hamiltonian paths of the Platonic graphs (in the order of tetrahedral, cubical, octahedral, dodecahedral, and icosahedral graph).

24, 144, 240, 3240, 75840

Offset

1,1

Comments

a(n)/2 is the number of undirected Hamiltonian paths of the Platonic graph corresponding to a(n).

From symmetry, a(n) is a multiple of A063723(n).

Links

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

Seiichi Manyama, Python program (github)

Eric Weisstein's World of Mathematics, Tetrahedral Graph

Eric Weisstein's World of Mathematics, Cubical Graph

Eric Weisstein's World of Mathematics, Octahedral Graph

Eric Weisstein's World of Mathematics, Dodecahedral Graph

Eric Weisstein's World of Mathematics, Icosahedral Graph

Crossrefs

Cf. A053016, A063723, A268283, A343213.

Sequence in context: A219988 A316928 A326856 * A076835 A007900 A158874

Adjacent sequences: A358957 A358958 A358959 * A358961 A358962 A358963

Keyword

nonn,fini,full

Author

Seiichi Manyama, Dec 07 2022

Status

approved