60270

Appears in sequences

• 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=24A035347
• Triangle of coefficients T(n,k) of polynomials p(n,x) = Sum_{k=0..n} T(n,k)*x^k where T(0,0) = 1, and T(n,k) = 0 for k < 0 or k > n, and T(n,k) = T(n-1,k-1) + (2*n-1+k)*T(n-1,k) for n > 0 and 0 <= k <= n.at n=41A265649
• 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=20A282575
• Maximum number of 6 sphinx tile shapes in a sphinx tiled hexagon of order n.at n=40A291582
• Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.at n=40A328762
• a(n) = ((n + 1) - 9*(n + 1)^2 + 8*(n + 1)^3)/6.at n=35A331987
• Sums of three primorials > 1.at n=53A370137