Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n.

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.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =0a(8) =1a(9) =3a(10) =0a(11) =0a(12) =1a(13) =3a(14) =5a(15) =0a(16) =0a(17) =1a(18) =5a(19) =8a(20) =7a(21) =0a(22) =0a(23) =1a(24) =8a(25) =19a(26) =17a(27) =11a(28) =0a(29) =0

External references