Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).
A282575
Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =3a(5) =15a(6) =28a(7) =6a(8) =52a(9) =210a(10) =190a(11) =10a(12) =203a(13) =1506a(14) =3360a(15) =1340a(16) =15a(17) =877a(18) =10871a(19) =48321a(20) =60270a(21) =9065a(22) =21a(23) =4140a(24) =80592a(25) =636300a(26) =1820056a(27) =1132880a(28) =57512a(29) =28
External references
- oeis: A282575