|
Search: id:A114935
|
|
|
| A114935 |
|
Number of connected (3,n)-hypergraphs (without empty edges). |
|
+0
3
|
|
| 0, 1, 6, 44, 332, 2476, 18136, 130824, 933372, 6610676, 46603616, 327603904, 2298933412, 16115938476, 112906938696, 790735321784, 5536710117452, 38763269947876, 271368229299376, 1899679393564464, 1329816419891749
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004.
|
|
FORMULA
|
E.g.f.: (1/3!)*(exp(7*x)-3*exp(4*x)+5*exp(3*x)-3*exp(2*x)+2*exp(x)-2).
|
|
CROSSREFS
|
Cf. A002501, A002502, A093732, A093732-A114934, A114936, A114937.
Sequence in context: A091162 A091163 A102591 this_sequence A115969 A082412 A108452
Adjacent sequences: A114932 A114933 A114934 this_sequence A114936 A114937 A114938
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 08 2006
|
|
|
Search completed in 0.002 seconds
|
