|
Search: id:A114932
|
|
|
| A114932 |
|
Number of connected (3,n)-hypergraphs (without empty edges and without multiple edges). |
|
+0
2
|
|
| 0, 0, 1, 25, 267, 2265, 17471, 128765, 927067, 6591505, 46545591, 327428805, 2298406067, 16114352345, 112902172111, 790721005645, 5536667136267, 38763140938785, 271367842141031, 1899678231827285, 13298160713181667
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
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)-exp(3*x)+3*exp(2*x)+2*exp(x)-2).
|
|
CROSSREFS
|
Cf. A002501, A002502, A093732, A093733, A114933-A114937.
Sequence in context: A090022 A017450 A058482 this_sequence A010830 A022717 A061617
Adjacent sequences: A114929 A114930 A114931 this_sequence A114933 A114934 A114935
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 08 2006
|
|
|
Search completed in 0.002 seconds
|
