57512

Appears in sequences

• Number of minimal covers of an n-set that cover exactly 3 points uniquely.at n=5A003467
• 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=30A035347
• Row sums of triangle defined in A059226.at n=7A059228
• Numbers with no 1's in their base-3, base-4, and base-5 expansions. Intersection of A005823, A023709, and A023725.at n=25A117482
• 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=28A282575
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/k)^3.at n=39A344721
• a(n) is the number of ways to partition an n X n X n cube into four noncongruent cuboids of different volumes.at n=38A385580