442222domain: NAppears in sequencesLookAndSay(n) is palindromic.at n=27A079676Irregular 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=61A329790