|
| |
|
|
A114937
|
|
Number of connected (5,n)-hypergraphs (without empty edges).
|
|
5
| |
|
|
0, 1, 15, 336, 8880, 254596, 7606446, 231899522, 7137539256, 220623286632, 6831984816402, 211719998195278, 6562887569336652, 203453536535818388, 6307290799931347878, 195532244201392935354, 6061637498660735815968
(list; graph; refs; listen; history; internal format)
|
|
|
|
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/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)-90*exp(6*x)+144*exp(5*x)-165*exp(4*x)+120*exp(3*x)-50*exp(2*x)+24*exp(x)-24).
|
|
|
CROSSREFS
| Cf. A002501, A002502, A093732, A093733, A114932-A114936.
Sequence in context: A025751 A027402 A053104 * A157965 A100875 A034975
Adjacent sequences: A114934 A114935 A114936 * A114938 A114939 A114940
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 08 2006
|
| |
|
|
