A326576 Total number of graceful labelings of the n-antiprism graph.

96, 832, 8080, 82032, 1039136, 19315328

Offset

3,1

Comments

Number of fundamentally distinct graceful labelings is a(n)/(2*|Aut(G)|), where |Aut(G)| is 48 for n = 3 and 4*n otherwise.

Links

Table of n, a(n) for n=3..8.

Eric Weisstein's World of Mathematics, Antiprism Graph.

Eric Weisstein's World of Mathematics, Graceful Labeling.

Formula

a(n) = 8*n*A387791(n) for n >= 4. - Eric W. Weisstein, Sep 12 2025

Crossrefs

Cf. A387791 (fundamentally distinct labelings).

Sequence in context: A269215 A096783 A253410 * A202890 A173615 A103846

Adjacent sequences: A326573 A326574 A326575 * A326577 A326578 A326579

Keyword

nonn,more

Author

Eric W. Weisstein, Jul 06 2020

Extensions

a(8)-a(10) from Eric W. Weisstein, Sep 12 2025

Status

approved