|
|
A268222
|
|
Triangle read by rows: T(n,k) (n>=5, 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,4,5,6,...,s,n} where s is the size of the largest proper open set in t.
|
|
5
|
|
|
5, 15, 30, 35, 105, 210, 70, 280, 840, 1680, 126, 630, 2520, 7560, 210, 1260, 6300, 25200, 75600, 151200, 330, 2310, 13860, 69300, 277200, 831600, 1663200, 495, 3960, 27720, 166320, 831600, 3326400, 9979200, 19958400
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
5,1
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
5,
15,30,
35,105,210,
70,280,840,1680,
126,630,2520,7560,15120,
210,1260,6300,25200,75600,151200,
...
|
|
MATHEMATICA
|
i = 4; Table[Table[Binomial[n, i] FactorialPower[n - i, k], {k, 0,
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|