Number of fundamentally different graceful labelings of the n-ladder graph.

A387802

Number of fundamentally different graceful labelings of the n-ladder graph.

Terms

    a(0) =1a(1) =1a(2) =16a(3) =177a(4) =2242a(5) =48068a(6) =1235617a(7) =42653229

External references