|
Search: id:A057963
|
|
|
| A057963 |
|
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). |
|
+0
10
|
|
| 1, 3, 3, 6, 12, 7, 10, 30, 35, 15, 15, 60, 105, 90, 31, 21, 105, 245, 315, 217, 63, 28, 168, 490, 840, 868, 504, 127, 36, 252, 882, 1890, 2604, 2268, 1143, 255, 45, 360, 1470, 3780, 6510, 7560, 5715, 2550, 511, 55, 495, 2310, 6930, 14322, 20790, 20955, 14025
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
Row sums give A000392.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Minimal cover
|
|
FORMULA
|
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.
|
|
EXAMPLE
|
[1], [3, 3], [6, 12, 7], [10, 30, 35, 15], ...; there are 90=10+30+35+15 minimal 2-covers of a labeled 5-set.
|
|
CROSSREFS
|
Cf. A035347, A057669, A057964-A057968.
Sequence in context: A110952 A025250 A094305 this_sequence A112434 A050067 A046875
Adjacent sequences: A057960 A057961 A057962 this_sequence A057964 A057965 A057966
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 17 2000
|
|
|
Search completed in 0.002 seconds
|
