4942070

Appears in sequences

• Number of minimal covers of an n-set that have exactly one point which appears in more than one set in the cover.at n=8A003466
• Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).at n=39A282575