|
%I #33 Feb 13 2023 15:43:32
%S 1,3,3,6,12,7,10,30,35,15,15,60,105,90,31,21,105,245,315,217,63,28,
%T 168,490,840,868,504,127,36,252,882,1890,2604,2268,1143,255,45,360,
%U 1470,3780,6510,7560,5715,2550,511,55,495,2310,6930,14322,20790,20955,14025
%N Triangle T(n,k) of number of minimal 2-covers of a labeled n-set that cover k points of that set uniquely (k=2,..,n).
%C Row sums give A000392.
%H Robert Israel, <a href="/A057963/b057963.txt">Table of n, a(n) for n = 2..10012</a> (rows 2 to 142, flattened)
%H Octavio A. Agustín-Aquino, <a href="http://arxiv.org/abs/1602.05279">Archimedes' quadrature of the parabola and minimal covers</a>, arXiv:1602.05279 [math.CO], 2016.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimalCover.html">Minimal cover</a>
%F Number of minimal m-covers of a labeled n-set that cover k points of that set uniquely is C(n, k)*S(k, m)*(2^m-m-1)^(n-k), where S(k, m) are Stirling numbers of the second kind. Here m=2.
%F From _Robert Israel_, Feb 18 2016: (Start)
%F T(n,k) = C(n,k) * (2^(k-1)-1).
%F G.f. of triangle: x^2*y^2/((1-x)*(1-x-x*y)*(1-x-2*x*y)). (End)
%e There are 90=10+30+35+15 minimal 2-covers of a labeled 5-set.
%e Triangle starts:
%e 1;
%e 3, 3;
%e 6, 12, 7;
%e 10, 30, 35, 15;
%e 15, 60, 105, 90, 31;
%e ...
%p seq(seq(binomial(n,k)*(2^(k-1)-1),k=2..n), n=2..13); # _Robert Israel_, Feb 18 2016
%t Table[ Binomial[n, k] (2^(k-1)-1), {n, 2, 13}, {k, 2, n}] // Flatten (* _Jean-François Alcover_, Sep 18 2018, from Maple *)
%o (PARI) T(n,k) = m=2; binomial(n, k)*stirling(k, m, 2)*(2^m-m-1)^(n-k); \\ _Michel Marcus_, Feb 18 2016
%o (Magma) /* As triangle: */ [[Binomial(n, k)*(2^(k-1)-1): k in [2..n]]: n in [1.. 15]]; // _Vincenzo Librandi_, Feb 19 2016
%Y Cf. A022166, A035347, A057669, A057964, A057965, A057966, A057967, A057968.
%K easy,nonn,tabl
%O 2,2
%A _Vladeta Jovovic_, Oct 17 2000
|
