login
Number of intersecting T_0-hypergraphs on a labeled n-set.
0

%I #4 May 10 2013 12:45:28

%S 2,4,26,1190,1302204,912799349556,291201248247281713961832

%N Number of intersecting T_0-hypergraphs on a labeled n-set.

%C Intersecting hypergraph is intersecting T_0-hypergraph if for every two distinct nodes there exists a hyperedge containing one but not the other node.

%Y Cf. A051185, A059083.

%K hard,nonn

%O 1,1

%A Goran Kilibarda, _Vladeta Jovovic_, Nov 28 2003