login
Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.
16

%I #10 Dec 17 2022 12:48:46

%S 2,4,96,31840,2147156736,9223372011084915712,

%T 170141183460469231602560095199828453376,

%U 57896044618658097711785492504343953923912733397452774312021795134847892828160

%N Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.

%H Goran Kilibarda and Vladeta Jovovic, <a href="https://arxiv.org/abs/1411.4187">Enumeration of some classes of T_0-hypergraphs</a>, arXiv:1411.4187 [math.CO], 2014.

%F E.g.f.: log(Sum(2^(2^n-1)*x^n/n!, n=0..infinity)).

%K nonn

%O 1,1

%A Goran Kilibarda and _Vladeta Jovovic_, Apr 16 2004