322240domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with exactly k connected components, n>=1, 1<=k<=n.at n=11A285616Number of meanders of length n with Motzkin-steps avoiding the consecutive steps HH.at n=14A329673