%I
%S 2,2,3,4,11,34,2136,7013320,29281354514767168,
%T 234431745534048922731115555415680,
%U 1994324729203114587259985605157804740271034553359179870979936357974016
%N Number of floor(n/2)uniform hypergraphs on n unlabeled nodes.
%C A hypergraph is called kuniform if all hyperedges have the same cardinality k.
%H Alois P. Heinz, <a href="/A309895/b309895.txt">Table of n, a(n) for n = 0..14</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hypergraph">Hypergraph</a>
%F a(n) = A309858(n,floor(n/2)) = A309865(n,floor(n/2)).
%Y Cf. A309858, A309865.
%K nonn
%O 0,1
%A _Alois P. Heinz_, Aug 21 2019
