Universal Boolean Formulas
A $O(2^n/\log n)$-size depth-3 universal Boolean formula was constructed in 


  O.B. Lupanov. Complexity of the universal parallel-series network of
  depth 3. Trudy Matem. Inst. Steklov, 133:127-131, 1973 (In Russian)


In this paper Lupanov uses language of parallel-series networks, which is equivalent to De Morgan formulas with unbounded fan-in AND, OR gates (parallel connection of two networks corresponds to disjunction and series connection corresponds to conjuction).