|
| |
|
|
A114936
|
|
Number of connected (4,n)-hypergraphs (without empty edges).
|
|
2
| |
|
|
0, 1, 10, 135, 1992, 30166, 458885, 6965225, 105358102, 1588998756, 23915093535, 359444209015, 5397938190512, 81022969645346, 1215801458118985, 18240857019892005, 273644796626023722, 4104936328561231936
(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/4!)*(exp(15*x)-4*exp(8*x)+6*exp(7*x)-3*exp(6*x)+12*exp(5*x)-24*exp(4*x)+23*exp(3*x)-11*exp(2*x)+6*exp(x)-6).
|
|
|
CROSSREFS
| Cf. A002501, A002502, A093732, A093732-A114935, A114937.
Sequence in context: A066156 A173044 A048666 * A095653 A024135 A050408
Adjacent sequences: A114933 A114934 A114935 * A114937 A114938 A114939
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 08 2006
|
| |
|
|
