|
Search: id:A114933
|
|
|
| A114933 |
|
Number of connected (4,n)-hypergraphs (without empty edges and without multiple edges). |
|
+0
3
|
|
| 0, 0, 0, 32, 1094, 23055, 405475, 6575842, 102567444, 1569195485, 23775369725, 358461659952, 5391042181294, 80974624209115, 1215462744452775, 18238484835400862, 273628186560143144, 4104820038944901945
(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/4!)*(exp(15*x)-4*exp(8*x)-6*exp(7*x)-3*exp(6*x)+12*exp(5*x)+12*exp(4*x)-exp(3*x)-11*exp(2*x)-6*exp(x)+6).
|
|
CROSSREFS
|
Cf. A002501, A002502, A093732, A093732, A114934-A114937.
Sequence in context: A009976 A144319 A041481 this_sequence A038097 A038096 A122123
Adjacent sequences: A114930 A114931 A114932 this_sequence A114934 A114935 A114936
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 08 2006
|
|
|
Search completed in 0.002 seconds
|
