Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n.
A280192
Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =3a(6) =1a(7) =9a(8) =0a(9) =19a(10) =10a(11) =12a(12) =114a(13) =0a(14) =219a(15) =31a(16) =300a(17) =190a(18) =2190a(19) =0a(20) =4231a(21) =361a(22) =1158a(23) =10140a(24) =4380a(25) =63465a(26) =0a(27) =130023a(28) =2164a(29) =26341
External references
- oeis: A280192