80592

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=6A003466
• Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).at n=34A035347
• Number of 3X3X3 triangular 0..n arrays with every horizontal row having the same average value.at n=22A214596
• 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=24A282575