86164domain: NAppears in sequencesa(n) = n*(n+1)*(2*n^3 - n^2 + 2)/6.at n=12A101383Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.at n=31A114506