74086domain: NAppears in sequencesTriangle read by rows: T(n, k) is the number of graphs obtained by adding k pierced circles to a path graph P_n.at n=29A354127Number of partitions of n with exactly five part sizes.at n=35A365631