|
Search: id:A059585
|
|
|
| A059585 |
|
Number of labeled 3-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included). |
|
+0
3
|
|
| 0, 0, 12, 68, 235, 636, 1478, 3088, 5958, 10800, 18612, 30756, 49049, 75868, 114270, 168128, 242284, 342720, 476748, 653220, 882759, 1178012, 1553926, 2028048, 2620850, 3356080, 4261140, 5367492, 6711093, 8332860, 10279166, 12602368
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
A hypergraph is a T_0 hypergraph if for every two distinct nodes there exists a hyperedge containing one but not the other node.
|
|
FORMULA
|
a(n) = binomial(n + 7, n) - 3*binomial(n + 3, n) + 2*binomial(n + 1, n) = n*(n - 1)*(n + 1)*(n^4 + 28*n^3 + 323*n^2 + 1988*n + 4572)/5040.
|
|
MAPLE
|
for n from 0 to 100 do printf(`%d, `, n*(n - 1)*(n + 1)*(n^4 + 28*n^3 + 323*n^2 + 1988*n + 4572)/5040) od:
|
|
CROSSREFS
|
Cf. A059084, a(n)=A059584(n, 3), A059586.
Sequence in context: A039925 A091074 A117088 this_sequence A050484 A096425 A101097
Adjacent sequences: A059582 A059583 A059584 this_sequence A059586 A059587 A059588
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Jan 23 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 24 2001
|
|
|
Search completed in 0.002 seconds
|
