Triangle of a(n,m) = number of m-member minimal T_0-covers of an n-set (n >= 0, 0<= m <=n).

Terms

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