1112032

Appears in sequences

• Number of n-vertex labeled graphs that are gracefully labeled trees.at n=11A033472
• Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1).at n=76A329790