|
Search: id:A035347
|
|
|
| A035347 |
|
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). |
|
+0
6
|
|
| 1, 0, 2, 0, 3, 5, 0, 6, 28, 15, 0, 10, 190, 210, 52, 0, 15, 1340, 3360, 1506, 203, 0, 21, 9065, 60270, 48321, 10871, 877, 0, 28, 57512, 1132880, 1820056, 636300, 80592, 4140, 0, 36, 344316, 21067452, 76834926, 45455676, 8081928, 618939, 21147, 0, 45
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Hearne and Wagner, Minimal covers of finite sets, Discr. Math. 5 (1973), 247-251.
|
|
FORMULA
|
a(n, k)=C(n, k)*Sum_{j=1..k} S(k, j)*(2^j-j-1)^(n-k), where S(k, j) are Stirling numbers of the second kind.
|
|
EXAMPLE
|
1; 0,2; 0,3,5; 0,6,28,15; ...
|
|
CROSSREFS
|
Cf. A056885 for unlabeled case. Row sums give A046165.
Sequence in context: A109921 A139637 A110990 this_sequence A094126 A038072 A161481
Adjacent sequences: A035344 A035345 A035346 this_sequence A035348 A035349 A035350
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 06 2000
|
|
|
Search completed in 0.002 seconds
|
