|
Search: id:A056885
|
|
|
| A056885 |
|
Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n. |
|
+0
12
|
|
| 1, 0, 1, 0, 0, 2, 0, 0, 1, 3, 0, 0, 1, 3, 5, 0, 0, 1, 5, 8, 7, 0, 0, 1, 8, 19, 17, 11, 0, 0, 1, 12, 45, 56, 35, 15, 0, 0, 1, 17, 107, 194, 151, 65, 22, 0, 0, 1, 24, 244, 713, 728, 365, 118, 30, 0, 0, 1, 32, 547, 2697, 3996, 2413, 835, 203, 42, 0, 0, 1, 42, 1173, 10356, 24446
(list; table; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
Row sums give A048194.
|
|
LINKS
|
V. Jovovic, Formula for T(n,k).
|
|
EXAMPLE
|
[1], [0,1], [0,0,2], [0,0,1,3], [0,0,1,3,5], [0,0,1,5,8,7], ...; There are 21=1+5+8+7 minimal covers of an unlabeled 5-set.
|
|
CROSSREFS
|
Cf. A035347 for labeled case.
Sequence in context: A122950 A116489 A166373 this_sequence A029373 A029362 A114510
Adjacent sequences: A056882 A056883 A056884 this_sequence A056886 A056887 A056888
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 04 2000
|
|
|
Search completed in 0.002 seconds
|
