login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A092918
Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.
16
2, 4, 96, 31840, 2147156736, 9223372011084915712, 170141183460469231602560095199828453376, 57896044618658097711785492504343953923912733397452774312021795134847892828160
OFFSET
1,1
LINKS
Goran Kilibarda and Vladeta Jovovic, Enumeration of some classes of T_0-hypergraphs, arXiv:1411.4187 [math.CO], 2014.
FORMULA
E.g.f.: log(Sum(2^(2^n-1)*x^n/n!, n=0..infinity)).
CROSSREFS
Sequence in context: A007534 A299784 A009379 * A018428 A128773 A101068
KEYWORD
nonn
AUTHOR
Goran Kilibarda and Vladeta Jovovic, Apr 16 2004
STATUS
approved