Extremal Graph Theory and Ramsey Theory · Challenge problem

Using $R(2,6)=6$ and $R(3,5)=14$, what does the recursion give as an upper bound for $R(3,6)$?