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).
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).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =0a(4) =3a(5) =5a(6) =0a(7) =6a(8) =28a(9) =15a(10) =0a(11) =10a(12) =190a(13) =210a(14) =52a(15) =0a(16) =15a(17) =1340a(18) =3360a(19) =1506a(20) =203a(21) =0a(22) =21a(23) =9065a(24) =60270a(25) =48321a(26) =10871a(27) =877a(28) =0a(29) =28
External references
- oeis: A035347