A387805 Number of fundamentally different graceful labelings of the n-path graph.

1, 1, 1, 1, 2, 6, 8, 10, 30, 74, 162, 332, 800, 2478, 6398, 13980, 35798, 127674, 362824, 874336, 2612956, 9642676, 29728748, 78808968, 253706188, 990921124, 3291532538, 9461575476, 32626991772, 133329657734, 471137553994, 1450030347984

Offset

1,5

Links

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

Eric Weisstein's World of Mathematics, Graceful Labeling.

Eric Weisstein's World of Mathematics, Pan Graph.

Formula

a(n) = A006967(n)/4 for n > 1. - Eric W. Weisstein, Sep 12 2025

Crossrefs

Cf. A006967 (graceful permutations of length n).

Cf. A112362. (A006967(n)/2.)

Cf. A006967 (all graceful labelings).

Sequence in context: A066198 A362667 A299381 * A247984 A108417 A373057

Adjacent sequences: A387802 A387803 A387804 * A387806 A387807 A387808

Keyword

nonn

Author

Eric W. Weisstein, Sep 08 2025

Status

approved