A268216 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A268216

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

2, 3, 6, 4, 12, 24, 5, 20, 60, 120, 6, 30, 120, 360, 720, 7, 42, 240, 840, 2520, 5040, 8, 56, 336, 1680, 6720, 20160, 40320, 9, 72, 504, 3024, 15120, 60480, 181440, 362880, 10, 90, 720, 5040, 30240, 151200, 604800, 1814400, 3628800

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,1

LINKS

Table of n, a(n) for n=2..46.

G. A. Kamel, Partial Chain Topologies on Finite Sets, Computational and Applied Mathematics Journal. Vol. 1, No. 4, 2015, pp. 174-179.

EXAMPLE

Triangle begins:

3, 6;

4, 12, 24;

5, 20, 60, 120;

6, 30, 120, 360, 720;