Upper bounds on the numbers of binary plateaued and bent functions

We prove that the logarithm of the number of binary n-variable bent functions is asymptotically less than \(\frac{11}{32}2^n\) $\frac{11}{32}{2}^n$ as \(n\rightarrow \infty \) $n\to \infty$ . We also prove an asymptotic upper bound on the number of s-plateaued functions.