80098domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 2.at n=48A101307Number of ordered trees with n edges and having no branches of length 2.at n=13A101308a(n) = n^4 + 984*n^3 + 902*n^2 + 394*n + 858.at n=4A163304