Extremal Graph Theory and Ramsey Theory · Challenge problem

For a random red/blue coloring of $K_n$, the expected number of monochromatic $K_6$'s is $\binom n6\,2^{1-15}$. What is the largest $n$ for which this is less than $1$?