344316

Appears in sequences

• Number of minimal covers of an n-set that cover exactly 3 points uniquely.at n=6A003467
• 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=38A035347
• 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=36A282575
• Sum of distinct products i*j*k with 1 <= i, j, k <= n.at n=15A323334