Triangle read by rows: T(n,k) (n>=4, k=3..n-1) 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,3,4,5,...,s,n} where s is the size of the largest proper open set in t.

A268221

Triangle read by rows: T(n,k) (n>=4, k=3..n-1) 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,3,4,5,...,s,n} where s is the size of the largest proper open set in t.

Terms

    a(0) =4a(1) =10a(2) =20a(3) =20a(4) =60a(5) =120a(6) =35a(7) =140a(8) =420a(9) =840a(10) =56a(11) =280a(12) =1120a(13) =3360a(14) =6720a(15) =84a(16) =504a(17) =2520a(18) =10080a(19) =30240a(20) =60480a(21) =120a(22) =840a(23) =5040a(24) =25200a(25) =100800a(26) =302400a(27) =604800a(28) =165a(29) =1320

External references