Triangle read by rows: T(n,k) (n>=6, k=3..n-3) is the number of topologies t on n points having exactly k open sets such that t contains exactly one open set of size m for each m in {0,5,6,7,...,s,n} where s is the size of the largest proper open set in t.
A268223
Triangle read by rows: T(n,k) (n>=6, k=3..n-3) is the number of topologies t on n points having exactly k open sets such that t contains exactly one open set of size m for each m in {0,5,6,7,...,s,n} where s is the size of the largest proper open set in t.
Terms
- a(0) =6a(1) =21a(2) =42a(3) =56a(4) =168a(5) =336a(6) =126a(7) =504a(8) =1512a(9) =3024a(10) =252a(11) =1260a(12) =5040a(13) =15120a(14) =30240a(15) =462a(16) =2772a(17) =13860a(18) =55440a(19) =166320a(20) =332640a(21) =792a(22) =5544a(23) =33264a(24) =166320a(25) =665280a(26) =1995840a(27) =3991680a(28) =1287a(29) =10296
External references
- oeis: A268223