Enumeration of intersecting families

It is shown that the logarithm to the base 2 of the number of maximal intersecting families on m elements is asymptotically equal to ($\text{m?1}\text{n?1}$) where $\text{n = [}\text{1}\text{2}\text{m]}$.