|
| |
|
|
A114934
|
|
Number of connected (5,n)-hypergraphs (without empty edges and without multiple edges).
|
|
2
| |
|
|
0, 0, 0, 21, 2773, 148365, 5878391, 204819447, 6721694469, 214306917321, 6736603947907, 210284186632443, 6541309609120385, 203129541349695597, 6302428271530970943, 195459285517696665759, 6060542952694406463421
(list; graph; refs; listen; history; internal format)
|
|
|
|
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/5!)*(exp(31*x)-5*exp(16*x)-10*exp(15*x)-10*exp(10*x)+20*exp(9*x)+40*exp(8*x)+65*exp(7*x)-30*exp(6*x)-96*exp(5*x)-45*exp(4*x)+20*exp(3*x)+50*exp(2*x)+24*exp(x)-24).
|
|
|
CROSSREFS
| Cf. A002501, A002502, A093732, A093732, A114933, A114935-A114937.
Sequence in context: A122801 A099680 A184367 * A098375 A202793 A095154
Adjacent sequences: A114931 A114932 A114933 * A114935 A114936 A114937
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 08 2006
|
| |
|
|
