8852398domain: NAppears in sequencesTotal number of graceful labelings of connected graphs with n vertices and n edges.at n=10A329789Irregular 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=75A329790